login

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”).

Number of (n+1) X (4+1) 0..1 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal maximum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.
1

%I #6 Apr 26 2023 11:48:32

%S 335,3160,31156,305872,3013228,29779356,294392852,2912660356,

%T 28819853684,285212776212,2822672937940,27936281452340,

%U 276491156846740,2736514043096372,27084166365743700,268061337010794484

%N Number of (n+1) X (4+1) 0..1 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal maximum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.

%C Column 4 of A253350.

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

%F Empirical: a(n) = 18*a(n-1) -73*a(n-2) -256*a(n-3) +2060*a(n-4) -1216*a(n-5) -12612*a(n-6) +18224*a(n-7) +20992*a(n-8) -40064*a(n-9) -9984*a(n-10) +24576*a(n-11) for n>14.

%e Some solutions for n=3

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

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

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

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

%Y Cf. A253350.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 30 2014