%I
%S 754,5125,35674,258746,1877439,13648650,99324229,722975673,5263920930,
%T 38326917454,279077519048,2032098819327,14796932438244,
%U 107745136076069,784558827528110,5712851702777901,41598809395672383,302906576301327635
%N Number of (n+2)X(1+2) 0..3 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order
%C Column 1 of A252917
%H R. H. Hardin, <a href="/A252913/b252913.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A252913/a252913.txt">Empirical recurrence of order 64</a>
%F Empirical recurrence of order 64 (see link above)
%e Some solutions for n=2
%e ..0..1..0....0..1..1....0..1..2....0..1..1....0..1..1....0..1..2....0..1..2
%e ..1..1..0....0..0..1....0..2..2....0..0..1....2..2..1....2..0..3....1..0..2
%e ..1..0..1....0..0..2....1..1..2....0..1..2....2..2..0....2..0..2....0..1..2
%e ..1..0..0....0..0..2....1..2..1....2..1..1....2..2..1....3..3..2....1..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 24 2014
