|
Search: id:A094322
|
|
|
| A094322 |
|
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids. |
|
+0
1
|
|
| 1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 4, 3, 3, 3, 1, 13, 11, 7, 6, 4, 1, 42, 37, 23, 14, 10, 5, 1, 139, 122, 78, 43, 25, 15, 6, 1, 470, 408, 262, 145, 75, 41, 21, 7, 1, 1616, 1390, 887, 494, 251, 124, 63, 28, 8, 1, 5632, 4810, 3048, 1694, 864, 414, 196, 92, 36, 9, 1, 19852, 16857, 10622
(list; table; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
COMMENT
|
A pyramid in a Dyck path is a factor of the form U^j D^j (j>0), starting at the x-axis. Here U=(1,1) and D(1,-1). This definition differs from the one in A091866. Column k=0 is A082989. Row sums are the Catalan numbers (A000108).
|
|
FORMULA
|
G.f.=G=G(t, z)=(1-z)/(1-zC+z^2*C -tz), where C=[1-sqrt(1-4z)]/(2z) is the Catalan function.
|
|
EXAMPLE
|
T(3,2)=2 because there are two Dyck paths of semilength 3 having 2 pyramids: (UD)(UUDD) and (UUDD)(UD) (pyramids shown between parentheses).
Triangle begins:
[1];[0, 1];[0, 1, 1];[1, 1, 2, 1];[4, 3, 3, 3, 1];[13, 11, 7, 6, 4, 1];[42, 37, 23, 14, 10, 5, 1];
|
|
MAPLE
|
C:=(1-sqrt(1-4*z))/2/z: G:=(1-z)/(1-z*C+z^2*C-t*z): Gserz:=simplify(series(G, z=0, 16)): P[0]:=1: for n from 1 to 14 do P[n]:=sort(coeff(Gserz, z^n)) od: seq([subs(t=0, P[n]), seq(coeff(P[n], t^k), k=1..n)], n=0..14);
|
|
CROSSREFS
|
Cf. A082989, A000108.
Adjacent sequences: A094319 A094320 A094321 this_sequence A094323 A094324 A094325
Sequence in context: A143122 A093067 A098122 this_sequence A136757 A134599 A117235
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 03 2004
|
|
|
Search completed in 0.002 seconds
|
