|
%I #4 Dec 24 2014 16:13:10
%S 28642,288263,3321526,42339952,551697392,7249491353,95923903361,
%T 1272678322381,16901116361226,224686312253900,2988072728793976,
%U 39740979216112866,528686297511992065,7033465700071654332
%N Number of (n+2)X(4+2) 0..3 arrays with every consecutive three elements in every row and column having exactly 2 distinct values, in every diagonal 1 or 2 distinct values, in every antidiagonal 2 or 3 distinct values, and new values 0 upwards introduced in row major order
%C Column 4 of A252910
%H R. H. Hardin, <a href="/A252908/b252908.txt">Table of n, a(n) for n = 1..38</a>
%e Some solutions for n=1
%e ..0..1..1..2..1..1....0..1..0..0..1..0....0..1..0..0..2..2....0..0..1..0..1..0
%e ..3..3..1..1..3..1....1..2..1..1..2..2....2..0..2..0..0..2....0..2..2..0..0..3
%e ..3..1..3..1..1..3....1..1..0..0..1..0....2..1..2..2..0..0....2..0..2..2..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 24 2014
| 