|
Search: id:A058300
|
|
|
| A058300 |
|
Number of ways of piling up n wine bottles above a row of n+1 bottles at ground level. |
|
+0
1
|
|
| 1, 1, 1, 3, 7, 16, 43, 115, 303, 813, 2203, 5991, 16371, 44917, 123598, 340988, 942930, 2612735, 7252407, 20163046, 56136326, 156488946, 436739752, 1220157514, 3412116339, 9550192161
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Related to the Catalan numbers (which count the ways of storing an arbitrary number of bottles above n bottles at ground level).
|
|
REFERENCES
|
R. P. Stanley: Enumerative Combinatorics (Volume 2); see Exercise 6.19(hhh).
|
|
FORMULA
|
Coefficient of w^(2*n+1)*z^(n+1) in the formal power series G(w, z) defined by G(w, z)=1+w*z*G(w, w*z)
|
|
EXAMPLE
|
a(4) = 7: the seven possibilities are:
..............0.............0.........0...............0.........0............0
.0.0.0.0.....0.0.0.......0.0.0.......0.0...0.....0...0.0.......0.0.0......0.0.0
0.0.0.0.0.,.0.0.0.0.0.,.0.0.0.0.0.,.0.0.0.0.0.,.0.0.0.0.0.,.0.0.0.0.0,.0.0.0.0.0
|
|
CROSSREFS
|
Sequence in context: A036567 A018023 A144977 this_sequence A000674 A129045 A005312
Adjacent sequences: A058297 A058298 A058299 this_sequence A058301 A058302 A058303
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
Roland Bacher (Roland.Bacher(AT)ujf-grenoble.fr), Dec 08 2000
|
|
|
Search completed in 0.002 seconds
|
