Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jan 05 2015 22:15:00
%S 551335,29206325,1542279536,82792688911,4447699041022,239233980672366,
%T 12871957348209417,692675041633315896,37276897289190737416,
%U 2006134944961310792573,107965441181623897136164
%N Number of (n+2)X(4+2) 0..2 arrays with every consecutive three elements in every row and diagonal having one or two distinct values, and in every column and antidiagonal having two or three distinct values, and new values 0 upwards introduced in row major order
%C Column 4 of A253615
%H R. H. Hardin, <a href="/A253614/b253614.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..0..0..1..0..1..1....0..0..1..1..0..0....0..0..1..0..0..0....0..0..1..0..1..0
%e ..0..2..0..2..0..0....1..0..0..1..1..2....2..0..0..0..0..0....0..0..1..1..1..2
%e ..1..2..2..0..2..0....2..2..1..2..2..1....1..1..2..2..1..2....1..1..0..1..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 05 2015