|
Search: id:A019500
|
|
|
| A019500 |
|
Number of 6-ary search trees on n keys. |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 1, 6, 21, 56, 126, 252, 492, 1062, 2667, 7252, 19509, 49824, 121019, 286974, 687384, 1702308, 4357383, 11322408, 29307458, 74897808, 189349041, 477491356, 1211349276, 3103673406, 8017385416, 20780391882, 53812468392
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
REFERENCES
|
J. A. Fill and R. P. Dobrow, The number of m-ary search trees on n keys, Combin. Probab. Comput. 6 (1997), 435-453.
|
|
LINKS
|
Index entries for sequences related to rooted trees
|
|
MAPLE
|
A:= proc(n) option remember; if n=0 then 1 else convert (series (sum (x^i, i=0..4)+ x^5*A(n-1)^6, x=0, n+1), polynom) fi end: a:= n-> coeff (A(n), x, n): seq (a(n), n=0..40); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 22 2008]
|
|
CROSSREFS
|
Sequence in context: A143980 A140228 A006090 this_sequence A100356 A137361 A058484
Adjacent sequences: A019497 A019498 A019499 this_sequence A019501 A019502 A019503
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
James Fill (jimfill(AT)jhu.edu)
|
|
EXTENSIONS
|
More terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 22 2008
|
|
|
Search completed in 0.003 seconds
|
