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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A251981 Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not 0 1 2 7 8 or 9 and every diagonal and antidiagonal sum 0 1 2 7 8 or 9 1

%I #4 Dec 12 2014 07:22:40

%S 1762248,113817844,1645790820,11222619848,144374047558,2806746475910,

%T 41357385753908,560931930325822,8312913112934056,125737685694939380,

%U 1850507500720597964,27163747162310463230,402094648138212121928

%N Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not 0 1 2 7 8 or 9 and every diagonal and antidiagonal sum 0 1 2 7 8 or 9

%C Column 6 of A251983

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

%e Some solutions for n=1

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 12 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:20 EDT 2024. Contains 371967 sequences. (Running on oeis4.)