|
Search: id:A000552
|
|
|
| A000552 |
|
Number of labeled rooted trees of height 3 with n nodes.
(Formerly M5159 N2241)
|
|
+0
1
|
|
| 24, 300, 3360, 38850, 475776, 6231960, 87530400, 1316954430, 21173760960, 362670636900, 6596214691248, 126980000240730, 2579214238608000, 55118036257959600, 1235935135837111104, 29009023670878484598
(list; graph; listen)
|
|
|
OFFSET
|
4,1
|
|
|
REFERENCES
|
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
|
|
LINKS
|
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
|
|
FORMULA
|
E.g.f.: x*(exp(x*exp(x*exp(x)))-exp(x*exp(x))). - Vladeta Jovovic (vladeta(AT)Eunet.yu), 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[ 5159 ] := n -> count(ht(3), size=n)-count(ht(2), size=n): seq(M[ 5159 ](n), n=4..19);
|
|
CROSSREFS
|
Sequence in context: A010976 A100130 A014103 this_sequence A125436 A096821 A053215
Adjacent sequences: A000549 A000550 A000551 this_sequence A000553 A000554 A000555
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from P. Zimmermann Mar 15 1996
|
|
|
Search completed in 0.002 seconds
|
