|
|
A019498
|
|
Number of 4-ary search trees on n keys.
|
|
0
|
|
|
1, 1, 1, 1, 4, 10, 20, 47, 128, 340, 868, 2275, 6188, 16922, 46112, 126613, 351568, 981622, 2747876, 7723250, 21811856, 61828886, 175752728, 500984606, 1432111244, 4104175970, 11787811340, 33926475162, 97837209036, 282662156478, 818022923184, 2371103693427
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
|
|
MAPLE
|
A:= proc(n) option remember; if n=0 then 1 else convert(series(sum(x^i, i=0..2)+ x^3*A(n-1)^4, 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*A[n-1]^4, {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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
James Fill (jimfill(AT)jhu.edu)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|