|
Search: id:A114580
|
|
|
| A114580 |
|
Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 3, 1, 7, 1, 1, 14, 6, 1, 26, 23, 1, 1, 46, 70, 10, 1, 79, 186, 56, 1, 1, 133, 451, 235, 15, 1, 221, 1025, 825, 115, 1, 1, 364, 2220, 2562, 630, 21, 1, 596, 4634, 7274, 2794, 211, 1, 1, 972, 9396, 19286, 10696, 1456, 28, 1, 1581, 18612, 48450, 36715
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
Row n contains 1+floor(n/2) terms. Row sums are the Motzkin numbers (A001006). Sum(k*T(n,k),k=0..floor(n/2))=A005774(n-1).
|
|
FORMULA
|
G.f.=G=G(t, z) satisfies G=1+zG+z^2[t(1+zG)+G-1-zG]G.
|
|
EXAMPLE
|
T(4,1)=7 because we have HH(U)D, H(U)DH, H(U)HD, (U)DHH, (U)HDH, (U)HHD and (UU)HH, where U=(1,1), H=(1,0), D=(1,-1) (the ascents are shown between parentheses).
Triangle begins:
1;
1;
1,1;
1,3;
1,7,1;
1,14,6;
1,26,23,1;
|
|
MAPLE
|
G:=1/2*(1-z+z^2-t*z^2-sqrt(1-z^2-2*z+2*z^3-2*z^3*t-2*z^2*t+z^4-2*z^4*t+z^4*t^2))\ /z^2/(z*t+1-z): Gserz:=simplify(series(G, z=0, 18)): P[0]:=1: for n from 1 to 15 do P[n]:=sort(coeff(Gserz, z^n)) od: for n from 0 to 15 do seq(coeff(t*P[n], t^j), j=1..1+floor(n/2)) od; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A001006, A005774.
Sequence in context: A051511 A026499 A143470 this_sequence A097229 A097862 A097612
Adjacent sequences: A114577 A114578 A114579 this_sequence A114581 A114582 A114583
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 09 2005
|
|
|
Search completed in 0.002 seconds
|
