login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019501 Number of 7-ary search trees on n keys. 0
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; refs; listen; history; text; internal format)
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

Table of n, a(n) for n=0..32.

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); # Alois P. Heinz, Aug 22 2008

MATHEMATICA

A[n_] := A[n] = If[n==0, 1, Series[Sum[x^i, {i, 0, 5}] + x^6*A[n-1]^7, {x, 0, n+1}] // Normal]; a[n_] := Coefficient[A[n], x, n]; Table[a[n], {n, 0, 40}] (* Jean-Fran├žois Alcover, Feb 19 2016, after Alois P. Heinz *)

CROSSREFS

Sequence in context: A000579 A290994 A049017 * A229887 A243741 A145456

Adjacent sequences:  A019498 A019499 A019500 * A019502 A019503 A019504

KEYWORD

nonn

AUTHOR

James Fill (jimfill(AT)jhu.edu)

EXTENSIONS

More terms from Alois P. Heinz, Aug 22 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 03:25 EDT 2018. Contains 316302 sequences. (Running on oeis4.)