|
%I #4 Dec 23 2014 15:48:09
%S 29241,9936,12762,26766,58644,126306,275598,596250,1300068,2826126,
%T 6150222,13372920,29103120,63319122,137750292,299686752,652050702,
%U 1418684886,3086460666,6715111032,14610041622,31786923600,69157031958
%N Number of (n+2)X(7+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order
%C Column 7 of A252861
%H R. H. Hardin, <a href="/A252860/b252860.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +4*a(n-2) -2*a(n-3) +4*a(n-4) -4*a(n-5) -29*a(n-6) +5*a(n-7) +4*a(n-8) +75*a(n-10) +79*a(n-11) -11*a(n-12) -163*a(n-13) -167*a(n-14) +3*a(n-15) +123*a(n-16) +135*a(n-17) +58*a(n-18) +4*a(n-19) -32*a(n-20) -39*a(n-21) -84*a(n-22) -61*a(n-23) +26*a(n-24) +47*a(n-25) +62*a(n-26) -3*a(n-27) -17*a(n-28) -21*a(n-29) -4*a(n-30) +6*a(n-31) +a(n-32) +2*a(n-33) -a(n-34) for n>36
%e Some solutions for n=4
%e ..0..0..1..1..2..2..0..2..0....0..1..0..1..1..2..1..2..1
%e ..1..0..1..0..1..0..0..2..2....1..0..0..2..2..1..1..0..0
%e ..0..2..2..1..1..2..2..0..2....1..1..2..1..2..2..0..2..0
%e ..1..2..2..0..2..0..2..2..1....0..0..2..2..1..1..0..0..1
%e ..1..1..0..0..2..2..0..0..1....0..1..1..2..1..2..1..2..1
%e ..2..2..0..2..0..2..0..2..0....2..1..1..0..0..1..1..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 23 2014
| 