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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A252915 Number of (n+2)X(3+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 90512,566649,5247300,54457598,606913688,6778023822,76682086492,

%T 869698248167,9878822337856,112256468346214,1276115781362754,

%U 14507747043563015,164948548762618549,1875445243541415216

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

%H R. H. Hardin, <a href="/A252915/b252915.txt">Table of n, a(n) for n = 1..29</a>

%e Some solutions for n=1

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

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

%e ..2..1..1..0..0....0..1..0..2..0....2..1..2..1..1....0..1..1..0..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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 07:48 EDT 2022. Contains 353693 sequences. (Running on oeis4.)