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 #6 Sep 04 2022 22:49:13
%S 1021428,10193041,43088793,49369118,159041102,325742026,933774220,
%T 3391678348,9927463676,34363573228,120867828716,419133745900,
%U 1533506476524,5688509028844,21334401501676,81613015824876
%N Number of (n+2) X (6+2) 0..1 arrays with every 3 X 3 subblock sum of the two maximums of the diagonal and antidiagonal minus the sum of the minimums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally.
%C Column 6 of A254260.
%H R. H. Hardin, <a href="/A254258/b254258.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) +12*a(n-2) -48*a(n-3) -176*a(n-4) +80*a(n-5) +1792*a(n-6) +640*a(n-7) -6400*a(n-8) -10240*a(n-9) +14336*a(n-10) +32768*a(n-11) -32768*a(n-12) for n>20.
%e Some solutions for n=1
%e ..0..0..0..0..0..1..0..1....0..0..0..0..1..1..0..0....0..0..1..1..1..0..1..0
%e ..0..0..0..1..1..0..0..1....0..0..0..0..0..0..1..1....0..0..0..0..0..0..1..1
%e ..0..1..1..0..1..1..1..1....0..0..1..1..0..0..1..1....1..1..1..1..1..1..0..1
%Y Cf. A254260.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 27 2015