[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A097892
Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k peaks at even height.
0
1, 1, 2, 4, 8, 1, 17, 4, 38, 12, 1, 88, 34, 5, 209, 95, 18, 1, 506, 264, 59, 6, 1244, 731, 187, 25, 1, 3097, 2020, 582, 92, 7, 7791, 5578, 1786, 322, 33, 1, 19773, 15404, 5420, 1096, 134, 8, 50563, 42558, 16308, 3652, 510, 42, 1, 130149, 117652, 48744, 11960, 1872
OFFSET
0,3
COMMENTS
Row sums are the Motzkin numbers (A001006).
FORMULA
G.f.=G=G(t, z) satisfies z^2*(1-z)G^2-(1-z)(1-z+z^2-tz^2)G+1-z+z^2-tz^2=0.
EXAMPLE
Triangle begins:
1;
1;
2;
4;
8,1;
17,4;
38,12,1;
Row n (n>=2) contains floor(n/2) terms.
T(5,1)=4 counts HU(UD)D, U(UD)DH, UH(UD)D and U(UD)HD, where U=(1,1), H=(1,0), D=(1,-1) (the peaks at even height are shown between parentheses).
CROSSREFS
Cf. A001006.
Sequence in context: A030275 A097874 A097885 * A197282 A215452 A362985
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Sep 03 2004
STATUS
approved