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 Apr 18 2015 08:22:38
%S 72249,191070,263630,594621,654637,640929,958492,1132789,1248657,
%T 1572262,1941929,2373418,2905927,3560325,4385532,5356772,6499076,
%U 7803937,9358455,11231036,13326754,15731695,18564935,21844896,25557915,29764072,34644954
%N Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally and vertically
%C Column 5 of A257209
%H R. H. Hardin, <a href="/A257206/b257206.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..0..1..0..0..1..1..1....0..1..0..1..0..0..1....0..0..0..1..1..0..0
%e ..1..0..0..0..1..1..1....0..0..0..1..1..1..1....1..0..0..1..1..1..1
%e ..0..0..1..0..0..0..1....1..0..0..0..0..0..0....0..1..1..1..0..0..1
%e ..0..0..1..1..1..1..1....1..1..1..0..0..0..1....0..1..0..0..0..1..1
%Y Cf. A257209
%K nonn
%O 1,1
%A _R. H. Hardin_, Apr 18 2015