login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Row sums are the Motzkin numbers (A001006).
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:37 EDT 2024. Contains 371963 sequences. (Running on oeis4.)