|
%I #4 Dec 25 2014 13:48:22
%S 3548,24001,176608,1350439,10388030,80232248,620852707,4808767844,
%T 37257749515,288739455911,2237986443070,17347242804844,
%U 134469582550424,1042391444409217,8080557887620007,62640695434924075,485595751974289946
%N Number of (n+2)X(3+2) 0..2 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 3 of A252993
%H R. H. Hardin, <a href="/A252989/b252989.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..1..0..0..2....0..0..1..0..1....0..0..1..1..2....0..0..1..1..0
%e ..1..0..1..1..2....2..0..0..2..2....2..0..0..2..2....1..1..0..0..1
%e ..1..1..0..0..1....2..1..1..2..2....0..1..1..2..1....0..0..1..0..1
%e ..0..1..1..0..1....1..0..1..1..0....0..0..1..1..2....1..0..0..2..0
%e ..1..0..1..1..0....1..0..0..2..0....1..0..0..1..1....0..1..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 25 2014
| 