The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253612 Number of (n+2)X(2+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 1

%I

%S 6916,131378,2501365,48041910,920906077,17665509894,338854514523,

%T 6500005331011,124684145636827,2391719505327311,45878483658735443,

%U 880051229318868232,16881337031496800473,323821540743313385720

%N Number of (n+2)X(2+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 2 of A253615

%H R. H. Hardin, <a href="/A253612/b253612.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=2

%e ..0..0..0..0....0..0..1..1....0..1..0..0....0..1..0..0....0..1..1..0

%e ..1..0..0..1....2..2..1..2....2..2..2..1....2..2..1..2....1..2..1..2

%e ..2..1..2..1....1..0..0..1....0..2..2..2....2..0..2..0....2..0..2..2

%e ..2..2..2..2....0..0..0..2....1..0..0..0....0..0..0..2....0..1..0..0

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 05 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 22:53 EST 2022. Contains 350654 sequences. (Running on oeis4.)