|
%I #4 Dec 01 2014 07:10:22
%S 42525,7530633,1333268433,236035946835,41786532918513,
%T 7397658897202791,1309640978922956217,231851661109674461595,
%U 41045747464323823946625,7266514192354994223128283,1286423850879599442443706681
%N Number of (n+1)X(4+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements
%C Column 4 of A251249
%H R. H. Hardin, <a href="/A251245/b251245.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 243*a(n-1) -12974*a(n-2) +236322*a(n-3) -1209024*a(n-4) -2903472*a(n-5) +39230408*a(n-6) +36692136*a(n-7) -81363872*a(n-8) -13350417264*a(n-9) -31190025008*a(n-10) +131686132896*a(n-11) +557194797504*a(n-12) +324811988352*a(n-13) +44140742400*a(n-14) +1172245859712*a(n-15) +1535371786496*a(n-16) -166686769152*a(n-17) +514029736704*a(n-18) +114288768000*a(n-19) -43963103232*a(n-20) -23758092288*a(n-21) -13501624320*a(n-22) +51425280*a(n-23) +35831808*a(n-24)
%e Some solutions for n=1
%e ..0..1..2..2..1....2..2..0..1..2....0..1..1..0..2....0..0..1..2..0
%e ..0..1..2..2..2....1..0..1..2..1....0..2..2..1..2....0..0..0..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 01 2014
| 