|
Search: id:A019501
|
|
|
| A019501 |
|
Number of 7-ary search trees on n keys. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 1, 7, 28, 84, 210, 462, 924, 1758, 3444, 7602, 19278, 52458, 142044, 368130, 905136, 2130198, 4895919, 11280885, 26685540, 65491062, 165584034, 423910572, 1080774261, 2717940687, 6731334225, 16494155097, 40308269022
(list; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
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..5)+ x^6*A(n-1)^7, 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: A023032 A000579 A049017 this_sequence A145456 A145135 A144900
Adjacent sequences: A019498 A019499 A019500 this_sequence A019502 A019503 A019504
|
|
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.002 seconds
|
