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

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

%I

%S 8151,52962,418853,3590945,31484714,273765237,2405660944,21164695786,

%T 186324939058,1640640634361,14450504045197,127278770331292,

%U 1121132081874962,9875584505122042,86991091605489586,766280168473793192

%N Number of (n+2)X(2+2) 0..3 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 Column 2 of A252917

%H R. H. Hardin, <a href="/A252914/b252914.txt">Table of n, a(n) for n = 1..110</a>

%e Some solutions for n=2

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 24 2014

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 22 19:15 EST 2022. Contains 350488 sequences. (Running on oeis4.)