

A114690


Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1<=k<=ceil(n/2)). A Motzkin path of length n is a lattice path from (0,0) to (n,0) consisting of U=(1,1), D=(1,1) and H=(1,0) steps and never going below the xaxis. A weak ascent in a Motzkin path is a maximal sequence of consecutive U and H steps.


1



1, 2, 3, 1, 5, 4, 8, 12, 1, 13, 31, 7, 21, 73, 32, 1, 34, 162, 116, 11, 55, 344, 365, 70, 1, 89, 707, 1041, 335, 16, 144, 1416, 2762, 1340, 135, 1, 233, 2778, 6932, 4726, 820, 22, 377, 5358, 16646, 15176, 4039, 238, 1, 610, 10188, 38560, 45305, 17157, 1785, 29, 987
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Row n has ceil(n/2) terms. Row sums are the Motzkin numbers (A001006). Column 1 yield the Fibonacci numbers (A000045). Sum(k*T(n,k)=A005773(n).


LINKS

Table of n, a(n) for n=1..57.


FORMULA

G.f. G=G(t, z) satisfies G=z(t+G)(1+z+zG).


EXAMPLE

T(4,2)=4 because we have (HU)D(H),(U)D(HH),(U)D(U)D and (UH)D(H) (the weak ascents are shown between parentheses).
Triangle starts:
1;
2;
3,1;
5,4;
8,12,1;
13,31,7;


MAPLE

G:=(1t*z^2zz^2sqrt(12*t*z^22*zz^2+t^2*z^42*t*z^32*z^4*t+2*z^3+z^4))/2/z^2: Gser:=simplify(series(G, z=0, 18)): for n from 1 to 15 do P[n]:=coeff(Gser, z^n) od: for n from 1 to 15 do seq(coeff(P[n], t^j), j=1..ceil(n/2)) od; # yields sequence in triangular form


CROSSREFS

Cf. A001006, A005773, A000045, A114655.
Sequence in context: A166285 A002472 A060116 * A294223 A238122 A214059
Adjacent sequences: A114687 A114688 A114689 * A114691 A114692 A114693


KEYWORD

nonn,tabf


AUTHOR

Emeric Deutsch, Dec 24 2005


STATUS

approved



