%I #4 Dec 25 2014 07:05:21
%S 193059,1192149,9627372,90331596,919418760,9729661266,104852356227,
%T 1141808774769,12498557877783,137122697754648,1506265056158256,
%U 16556855861702691,182042797661939664,2001875638434886899
%N Number of (n+2)X(6+2) 0..2 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order
%C Column 6 of A252952
%H R. H. Hardin, <a href="/A252950/b252950.txt">Table of n, a(n) for n = 1..23</a>
%e Some solutions for n=1
%e ..0..0..1..1..2..1..1..2....0..1..0..0..2..2..0..2....0..0..1..0..1..1..2..2
%e ..1..0..1..0..0..2..0..2....0..1..0..1..0..0..2..0....0..1..1..2..1..1..0..0
%e ..0..2..2..0..0..1..1..0....1..0..1..0..0..2..2..0....1..1..0..0..2..0..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 25 2014