login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000553 Number of labeled rooted trees of height 4 with n nodes.
(Formerly M5378 N2335)
1
120, 2520, 43680, 757680, 13747104, 264181680, 5395040640, 117080049240, 2696387899920, 65774992411128, 1695845836077120, 46110625382246880, 1319345179723609920, 39640903618873667040, 1248193457738661143808 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,1
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
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
FORMULA
E.g.f.: x*(exp(x*exp(x*exp(x*exp(x)))) - exp(x*exp(x*exp(x)))). - Vladeta Jovovic, Jan 29 2008
MAPLE
ht := proc(m) local i; [ T0, {seq(T.i=Prod(Z, Set(T.(i+1))), i=0..m-1), T.m=Z}, labeled ] end: M[ 5378 ] := n -> count(ht(4), size=n)-count(ht(3), size=n): seq(M[ 5378 ](n), n=5..19);
MATHEMATICA
egf = x*(Exp[x*Exp[x*Exp[x*Exp[x]]]] - Exp[x*Exp[x*Exp[x]]]); a[n_] := SeriesCoefficient[egf, {x, 0, n}]*n!; Table[a[n], {n, 5, 19}] (* Jean-François Alcover, Jan 17 2014, after Vladeta Jovovic *)
CROSSREFS
Sequence in context: A267839 A220050 A032180 * A126232 A105943 A219945
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Paul Zimmermann, Mar 15 1996
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 07:46 EDT 2024. Contains 372020 sequences. (Running on oeis4.)