This site is supported by donations to The OEIS Foundation.

 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) 0
 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 J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478. 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 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); CROSSREFS Sequence in context: A038745 A220050 A032180 * A126232 A105943 A219945 Adjacent sequences:  A000550 A000551 A000552 * A000554 A000555 A000556 KEYWORD nonn AUTHOR EXTENSIONS More terms from P Zimmermann Mar 15 1996 STATUS approved

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

Content is available under The OEIS End-User License Agreement .