|
Search: id:A092107
|
|
|
| A092107 |
|
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively. |
|
+0
2
|
|
| 1, 1, 2, 4, 1, 9, 4, 1, 21, 15, 5, 1, 51, 50, 24, 6, 1, 127, 161, 98, 35, 7, 1, 323, 504, 378, 168, 48, 8, 1, 835, 1554, 1386, 750, 264, 63, 9, 1, 2188, 4740, 4920, 3132, 1335, 390, 80, 10, 1, 5798, 14355, 17028, 12507, 6237, 2200, 550, 99, 11, 1, 15511, 43252, 57816
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Column 0 gives the Motzkin numbers (A001006), column 1 gives A014532. Row sums are the Catalan numbers (A000108).
|
|
REFERENCES
|
A. Sapounakis, I. Tasoulas and P. Tsikouras, Counting strings in Dyck paths, Discrete Math., 307 (2007), 2909-2924.
Y. Sun, The statistic "number of udu's" in Dyck paths, Discrete Math., 237 (2004), 177-186.
|
|
FORMULA
|
G.f. G=G(t, z) satisfies z(t+z-tz)G^2-(1-z+tz)G+1=0.
|
|
EXAMPLE
|
T(5,2)=5 because we have (U[UU)U]DUDDDD, (U[UU)U]DDUDDD, (U[UU)U]DDDUDD,
(U[UU)U]DDDDUD and UD(U[UU)U]DDDD, where U=(1,1), D=(1,-1); the triple rises are shown between parentheses.
[1],[1],[2],[4, 1],[9, 4, 1],[21, 15, 5, 1],[51, 50, 24, 6, 1],[127, 161, 98, 35, 7, 1]
|
|
CROSSREFS
|
Cf. A001006, A014532.
Sequence in context: A077387 A057551 A019823 this_sequence A114489 A101974 A097607
Adjacent sequences: A092104 A092105 A092106 this_sequence A092108 A092109 A092110
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 29 2004
|
|
|
Search completed in 0.002 seconds
|
