# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a253395 Showing 1-1 of 1 %I A253395 #7 Dec 12 2018 06:51:47 %S A253395 476,320,419,632,932,1318,1855,2528,3408,4498,5864,7521,9542,11949, %T A253395 14824,18197,22158,26745,32056,38137,45094,52981,61912,71949,83214, %U A253395 95777,109768,125265,142406,161277,182024,204741,229582,256649,286104,318057 %N A253395 Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically. %H A253395 R. H. Hardin, Table of n, a(n) for n = 1..210 %F A253395 Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + 5*a(n-4) - 4*a(n-5) + a(n-6) for n>16. %F A253395 Empirical for n mod 2 = 0: a(n) = (1/6)*n^4 + (185/6)*n^2 - 61*n + 357 for n>10. %F A253395 Empirical for n mod 2 = 1: a(n) = (1/6)*n^4 + (185/6)*n^2 - 61*n + 364 for n>10. %F A253395 Empirical g.f.: x*(476 - 1584*x + 1519*x^2 + 556*x^3 - 1881*x^4 + 1054*x^5 - 48*x^6 - 106*x^7 + 20*x^8 + 12*x^9 - 23*x^10 + 17*x^11 - 5*x^12 + 2*x^14 - x^15) / ((1 - x)^5*(1 + x)). - _Colin Barker_, Dec 12 2018 %e A253395 Some solutions for n=4: %e A253395 ..0..1..0..1..0..1..1....1..1..1..0..0..0..1....1..1..1..1..1..1..1 %e A253395 ..0..1..0..1..0..1..0....1..1..1..1..1..1..1....1..1..1..0..0..0..0 %e A253395 ..0..1..0..1..0..1..0....1..1..0..0..0..0..0....1..1..1..1..1..1..1 %e A253395 ..0..1..0..1..0..1..0....1..1..1..1..1..1..1....1..0..0..0..0..0..0 %e A253395 ..0..1..0..1..0..1..0....0..0..0..0..0..0..0....0..0..1..1..1..1..1 %Y A253395 Column 6 of A253397. %K A253395 nonn %O A253395 1,1 %A A253395 _R. H. Hardin_, Dec 31 2014 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE