|
%I #4 Nov 26 2014 10:47:45
%S 125,654,2969,12360,49310,190213,720347,2690076,9964237,36686400,
%T 134581437,492406440,1798700175,6562904559,23928907661,87203461550,
%U 317693877115,1157153380541,4214191335186,15346090893547,55879956700824
%N Number of (2+1)X(n+1) 0..2 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 2 of A250632
%H R. H. Hardin, <a href="/A250634/b250634.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 9*a(n-1) -21*a(n-2) -32*a(n-3) +195*a(n-4) -160*a(n-5) -371*a(n-6) +679*a(n-7) +5*a(n-8) -716*a(n-9) +413*a(n-10) +152*a(n-11) -200*a(n-12) +48*a(n-13) for n>16
%e Some solutions for n=4
%e ..0..0..0..0..2....0..0..0..2..1....0..0..0..1..1....0..0..0..0..0
%e ..0..0..0..1..1....0..0..1..1..2....0..0..1..1..2....0..1..0..0..1
%e ..0..0..0..1..1....1..2..1..2..2....2..2..0..2..1....1..0..2..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 26 2014
|
