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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019499 Number of 5-ary search trees on n keys. 0
1, 1, 1, 1, 1, 5, 15, 35, 70, 146, 360, 980, 2620, 6620, 16276, 40740, 105820, 280780, 743700, 1950756, 5101470, 13429110, 35693650, 95433290, 255434106, 683340050, 1829832350, 4913953750, 13239959100, 35758234300, 96702404700, 261768987260, 709479051420 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

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(add(x^i, i=0..3)+ x^4*A(n-1)^5, 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[1 + x + x^2 + x^3 + x^4*A[n-1]^5, {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: A195761 A100355 A048032 * A229885 A243739 A145133

Adjacent sequences:  A019496 A019497 A019498 * A019500 A019501 A019502

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 20:17 EST 2019. Contains 320328 sequences. (Running on oeis4.)