login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A000950
Number of forests with n nodes and height at most 3.
(Formerly M3025 N1225)
4
1, 3, 16, 125, 1176, 12847, 160504, 2261289, 35464816, 612419291, 11539360944, 235469524237, 5170808565976, 121535533284999, 3043254281853496, 80852247370051793, 2270951670959226336, 67221368736302224819, 2091039845329887687136
OFFSET
1,2
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
John Riordan, Forests of labeled trees, J. Combin. Theory, 5 (1968), 90-103.
FORMULA
E.g.f.: exp(x*exp(x*exp(x*exp(x)))).
MATHEMATICA
nn = 20; Range[0, nn]! CoefficientList[Series[Exp[x*Exp[x*Exp[x*Exp[x]]]], {x, 0, nn}], x] (* T. D. Noe, Jun 21 2012 *)
CROSSREFS
Column k=3 of A210725. - Alois P. Heinz, Mar 15 2013
Sequence in context: A327826 A157457 A365626 * A320254 A365627 A245012
KEYWORD
nonn
EXTENSIONS
More terms from Vladeta Jovovic, Apr 07 2001
STATUS
approved