|
| |
|
|
A129182
|
|
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n such that the area between the x-axis and the path is k (n>=0; 0<=k<=n^2).
|
|
2
| |
|
|
1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 3, 0, 3, 0, 3, 0, 2, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 4, 0, 6, 0, 7, 0, 7, 0, 5, 0, 5, 0, 3, 0, 2, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 5, 0, 10, 0, 14, 0, 17, 0, 16, 0, 16, 0, 14, 0, 11, 0, 9, 0, 7, 0, 5, 0, 3, 0, 2, 0, 1, 0, 1, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,14
|
|
|
COMMENTS
| Row n has n^2 + 1 terms. Row sums are the Catalan numbers (A000108). Sum(k*T(n,k),k=0..n^2)=A008549(n).
|
|
|
FORMULA
| G.f.=G(t,z) given by G(t,z)=1+tzG(t,t^2*z)G(t,z).
|
|
|
EXAMPLE
| T(4,10)=3 because we have UDUUUDDD, UUUDDDUD and UUDUDUDD.
Triangle starts:
1;
0,1;
0,0,1,0,1;
0,0,0,1,0,2,0,1,0,1;
0,0,0,0,1,0,3,0,3,0,3,0,2,0,1,0,1;
0,0,0,0,0,1,0,4,0,6,0,7,0,7,0,5,0,5,0,3,0,2,0,1,0,1;
|
|
|
MAPLE
| G:=1/(1-t*z*g[1]): for i from 1 to 11 do g[i]:=1/(1-t^(2*i+1)*z*g[i+1]) od: g[12]:=0: Gser:=simplify(series(G, z=0, 11)): for n from 0 to 7 do P[n]:=sort(coeff(Gser, z, n)) od: for n from 0 to 7 do seq(coeff(P[n], t, j), j=0..n^2) od; # yields sequence in triangular form
|
|
|
CROSSREFS
| Cf. A000108, A008549.
Sequence in context: A203951 A105348 A016406 * A116857 A158971 A121467
Adjacent sequences: A129179 A129180 A129181 * A129183 A129184 A129185
|
|
|
KEYWORD
| nonn,tabf
|
|
|
AUTHOR
| Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 08 2007
|
| |
|
|
