Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jun 02 2015 09:13:37
%S 294960,2927601,18460629,27337100,65947572,159909048,376000912,
%T 1197367724,3293371180,8405740372,25638745828,73266758932,
%U 207386130564,602882751988,1758606399332,4902574429396,14705322089028,43968973836212
%N Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two maximums of the central row and central column plus the two minimums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally
%C Column 5 of A258530
%H R. H. Hardin, <a href="/A258527/b258527.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2*a(n-1) +7*a(n-2) +8*a(n-3) -24*a(n-4) -72*a(n-5) +144*a(n-6) -1472*a(n-7) -1280*a(n-8) +3712*a(n-9) +28672*a(n-10) +9216*a(n-11) -88064*a(n-12) -98304*a(n-13) +16384*a(n-14) +393216*a(n-15) -262144*a(n-16) for n>25
%e Some solutions for n=1
%e ..0..1..1..0..1..1..1....0..1..0..0..1..1..0....0..1..1..0..1..0..0
%e ..1..1..0..1..0..0..1....0..0..0..1..0..1..0....0..0..0..0..1..0..0
%e ..0..0..0..1..0..0..0....0..1..0..0..1..1..1....0..1..0..1..1..1..0
%Y Cf. A258530
%K nonn
%O 1,1
%A _R. H. Hardin_, Jun 02 2015