|
%I #8 Nov 15 2018 11:07:50
%S 36,154,585,2183,7924,28456,101308,358990,1268051,4470464,15740673,
%T 55379788,194741827,684584785,2406055663,8455258981,29710611016,
%U 104393359779,366791460582,1288712370834,4527794056964,15907920902171
%N Number of (1+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.
%H R. H. Hardin, <a href="/A250633/b250633.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) - 2*a(n-2) - 14*a(n-3) + 7*a(n-4) + 10*a(n-5) - 5*a(n-6) - 2*a(n-7) + a(n-8).
%F Empirical g.f.: x*(36 - 26*x - 113*x^2 + 70*x^3 + 83*x^4 - 46*x^5 - 17*x^6 + 9*x^7) / ((1 - 2*x - x^2 + x^3)*(1 - 3*x - 3*x^2 + 4*x^3 + x^4 - x^5)). - _Colin Barker_, Nov 15 2018
%e Some solutions for n=4:
%e ..0..0..0..1..1....0..0..0..0..0....0..0..0..1..2....0..0..0..0..0
%e ..0..1..2..2..2....0..0..1..1..0....2..2..1..1..2....0..1..1..2..0
%Y Row 1 of A250632.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 26 2014
|
