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

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

%I #6 Apr 11 2023 13:40:28

%S 25137,71856,437805,1358948,11582748,82404422,264208755,2251674722,

%T 16173953810,51883573465,440765079936,3186639297404,10218761909241,

%U 86515825268745,629079874649132,2016591091045729,17021928855523720

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

%C Column 7 of A252615.

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

%F Empirical: a(n) = 422*a(n-3) -53028*a(n-6) +1992375*a(n-9) -57559941*a(n-12) +1160058288*a(n-15) -13060432898*a(n-18) +76525133647*a(n-21) -226007166324*a(n-24) +355217689092*a(n-27) -363893614656*a(n-30) +282528094464*a(n-33) -134212488192*a(n-36) +21798346752*a(n-39) for n>48.

%e Some solutions for n=2

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

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

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

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

%Y Cf. A252615.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 19 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 June 9 01:30 EDT 2023. Contains 363168 sequences. (Running on oeis4.)