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!)
A114576 Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k UH's, where U=(1,1), H=(1,0) (0<=k<=floor(n/3)). 0
1, 1, 2, 3, 1, 6, 3, 11, 10, 23, 26, 2, 47, 70, 10, 102, 176, 45, 221, 449, 160, 5, 493, 1121, 539, 35, 1105, 2817, 1680, 196, 2516, 7031, 5082, 868, 14, 5763, 17604, 14856, 3486, 126, 13328, 43996, 42660, 12810, 840, 30995, 110147, 120338, 44640, 4410, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Row n contains 1+floor(n/3) terms. Row sums are the Motzkin numbers (A001006). Column 0 yields A090344. Sum(k*T(n,k),k=0..floor(n/3))=A014531(n-2).
LINKS
FORMULA
G.f.=[1-z-sqrt(1-2z-3z^2-4tz^3+4z^3)]/[2(1-z+tz)z^2].
EXAMPLE
T(4,1)=3 because we have H(UH)D, (UH)DH and (UH)HD, where U=(1,1), H=(1,0), D=(1,-1) (the UH's are shown between parentheses).
Triangle begins:
1;
1;
2;
3,1;
6,3;
11,10;
23,26,2;
47,70,10;
MAPLE
G:=(1-z-sqrt(1-2*z-3*z^2-4*z^3*t+4*z^3))/2/z^2/(1-z+t*z): Gser:=simplify(series(G, z=0, 20)): P[0]:=1: for n from 1 to 16 do P[n]:=coeff(Gser, z^n) od: for n from 0 to 16 do seq(coeff(t*P[n], t^j), j=1..1+floor(n/3)) od; # yields sequence in triangular form
CROSSREFS
Sequence in context: A166295 A016730 A319192 * A198724 A223486 A205112
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Dec 09 2005
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 March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)