|
%I #4 Jan 31 2015 07:46:32
%S 512,2696,12260,47140,170504,586508,1964388,6462708,21003228,67662328,
%T 216533720,689480684,2187191068,6918332408,21836278536,68808353156,
%U 216551437648,680873827704,2139217784216,6717384585616,21084279168188
%N Number of (n+2)X(1+2) 0..1 arrays with every 3X3 subblock diagonal sum minus antidiagonal minimum nondecreasing horizontally and vertically
%C Column 1 of A254483
%H R. H. Hardin, <a href="/A254476/b254476.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 6*a(n-1) -8*a(n-2) -9*a(n-3) +19*a(n-4) +4*a(n-5) -22*a(n-6) +23*a(n-7) +5*a(n-8) -162*a(n-9) +276*a(n-10) -83*a(n-11) -50*a(n-12) +218*a(n-13) -326*a(n-14) +66*a(n-15) +9*a(n-16) -60*a(n-17) +78*a(n-18) +5*a(n-19) +23*a(n-20) -6*a(n-21) +4*a(n-22) -a(n-23) -5*a(n-24) -2*a(n-26) -a(n-27) for n>32
%e Some solutions for n=4
%e ..0..0..1....0..0..1....1..1..0....0..0..1....0..1..1....0..0..1....1..0..1
%e ..1..1..0....0..0..1....0..0..0....0..1..1....1..0..0....0..0..1....0..1..0
%e ..0..1..0....1..0..1....1..1..1....1..1..0....1..1..1....0..1..0....1..1..0
%e ..1..1..0....1..0..1....1..1..1....1..1..0....1..0..0....1..0..1....1..1..0
%e ..1..1..1....1..1..1....1..0..1....0..0..0....0..0..1....1..1..1....0..1..1
%e ..0..1..1....1..1..1....0..1..1....1..1..1....1..1..1....1..1..1....1..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 31 2015
| 