|
%I #4 Dec 24 2014 09:07:09
%S 18931,175360,1769486,18443090,194162037,2048947027,21664764833,
%T 229288736507,2428049723198,25721944590553,272531782389953,
%U 2887876599290471,30603380003328253,324319086764842024
%N Number of (3+2)X(n+2) 0..2 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 Row 3 of A252882
%H R. H. Hardin, <a href="/A252885/b252885.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..0..0..1..0....0..0..1..1....0..1..1..0....0..1..0..0....0..1..0..0
%e ..1..0..1..0....0..1..0..1....0..1..1..0....0..1..1..2....1..0..0..1
%e ..0..0..2..0....0..0..1..1....0..1..0..2....0..1..0..0....1..1..2..1
%e ..1..2..1..0....2..0..1..0....2..2..1..0....2..2..1..0....1..1..2..2
%e ..0..0..2..1....0..0..1..1....0..1..0..2....2..1..0..0....1..2..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 24 2014
| 