|
Search: id:A065601
|
|
|
| A065601 |
|
Number of Dyck paths of length 2n with exactly 1 hill. |
|
+0
3
|
|
| 1, 0, 2, 4, 13, 40, 130, 432, 1466, 5056, 17672, 62460, 222853, 801592, 2903626, 10582816, 38781310, 142805056, 528134764, 1960825672, 7305767602, 27307800400, 102371942932, 384806950624, 1450038737668, 5476570993440
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Convolution of A000957(n) (n>=1) with itself.
|
|
REFERENCES
|
E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999) 167-202.
E. Deutsch and L. Shapiro, A survey of the Fine numbers, Discrete Math., 241 (2001), 241-265.
|
|
FORMULA
|
Reference gives g.f.'s.
|
|
CROSSREFS
|
2nd column of A065600. Cf. A000957.
Sequence in context: A033091 A133453 A085422 this_sequence A118930 A087214 A002771
Adjacent sequences: A065598 A065599 A065600 this_sequence A065602 A065603 A065604
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Dec 02 2001
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 03 2001
|
|
|
Search completed in 0.002 seconds
|
