editing
approved
editing
approved
R. H. Hardin, <a href="/A250821/b250821.txt">Table of n, a(n) for n = 1..210</a>
allocated for R. H. Hardin
Number of (n+2)X(2+2) 0..1 arrays with nondecreasing maximum minus minimum of every three consecutive values in every row and column
2744, 22874, 176184, 1217728, 8095062, 52143132, 330659096, 2074791394, 12942194000, 80432210624, 498785770398, 3089054432500, 19116076203672, 118241047553034, 731167427050088, 4520568431591104, 27946423065952262
1,1
Column 2 of A250826
Empirical: a(n) = 9*a(n-1) -5*a(n-2) -91*a(n-3) +5*a(n-4) +431*a(n-5) +799*a(n-6) -1199*a(n-7) -4097*a(n-8) -1157*a(n-9) +8766*a(n-10) +11816*a(n-11) -4685*a(n-12) -20537*a(n-13) -12267*a(n-14) +11123*a(n-15) +19714*a(n-16) +5392*a(n-17) -8559*a(n-18) -8485*a(n-19) -695*a(n-20) +2925*a(n-21) +1310*a(n-22) -248*a(n-23) -338*a(n-24) +36*a(n-25) +56*a(n-26) -16*a(n-27) -3*a(n-28) +a(n-29)
Some solutions for n=3
..1..0..0..1....0..1..0..0....0..1..1..0....1..0..0..1....0..0..0..0
..0..1..1..0....0..0..1..0....0..1..1..0....0..0..1..1....0..0..1..0
..0..1..0..0....0..1..0..0....0..0..1..0....1..1..0..1....1..0..1..0
..1..0..1..1....0..0..1..0....1..1..1..0....0..0..1..0....1..1..0..0
..0..0..0..1....0..1..0..0....0..1..0..1....0..0..1..0....0..0..1..0
allocated
nonn
R. H. Hardin, Nov 27 2014
approved
editing
allocated for R. H. Hardin
allocated
approved