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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256951 Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the central row and central column minus the two minimums of the diagonal and antidiagonal nondecreasing horizontally and vertically 1

%I

%S 154680,844499,2663867,6304044,11818550,18296498,26587024,37470100,

%T 53161612,69050742,91680642,119433538,159000950,201303722,261166670,

%U 335773334,446131442,569452246,754791850,989860526,1351069110,1770887594

%N Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the central row and central column minus the two minimums of the diagonal and antidiagonal nondecreasing horizontally and vertically

%C Column 5 of A256954

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

%F Empirical: a(n) = 2*a(n-1) -2*a(n-3) +7*a(n-4) -11*a(n-5) -2*a(n-6) +12*a(n-7) -12*a(n-8) +9*a(n-9) +12*a(n-10) -16*a(n-11) -4*a(n-12) +14*a(n-13) -16*a(n-14) +16*a(n-16) -8*a(n-17) for n>35

%e Some solutions for n=1

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

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

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

%Y Cf. A256954

%K nonn

%O 1,1

%A _R. H. Hardin_, Apr 13 2015

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 August 19 16:39 EDT 2022. Contains 356229 sequences. (Running on oeis4.)