|
%I #4 Nov 26 2014 22:10:27
%S 100,654,3674,19876,102963,521684,2597784,12791393,62471749,303365393,
%T 1467083010,7073825450,34034432454,163494484120,784498580843,
%U 3761138943767,18021126036602,86307928183894,413216314086236
%N Number of (1+1)X(n+1) 0..3 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction
%C Row 1 of A250707
%H R. H. Hardin, <a href="/A250708/b250708.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) -25*a(n-2) -30*a(n-3) +166*a(n-4) -43*a(n-5) -343*a(n-6) +230*a(n-7) +301*a(n-8) -287*a(n-9) -110*a(n-10) +159*a(n-11) +5*a(n-12) -41*a(n-13) +6*a(n-14) +4*a(n-15) -a(n-16)
%e Some solutions for n=4
%e ..3..0..0..0..2....0..1..1..1..1....1..0..0..3..2....0..2..0..2..3
%e ..0..3..2..1..3....3..0..2..3..3....0..1..2..2..3....3..0..3..2..3
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 26 2014
|
