|
Search: id:A000235
|
|
|
| A000235 |
|
Number of n-node rooted trees of height 3.
(Formerly M2732 N1097)
|
|
+0
16
|
|
| 0, 0, 0, 1, 3, 8, 18, 38, 76, 147, 277, 509, 924, 1648, 2912, 5088, 8823, 15170, 25935, 44042, 74427, 125112, 209411, 348960, 579326, 958077, 1579098, 2593903, 4247768, 6935070, 11290627, 18330973, 29684082, 47946852, 77258764, 124198083
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n=1..200
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
N. J. A. Sloane, Maple programs for counting rooted trees by height (after Riordan)
|
|
FORMULA
|
A001383(n)-A000041(n-1). (Christian G. Bower (bowerc(AT)usa.net)).
|
|
MAPLE
|
For Maple program see link.
ZL:=proc(m) local i; [T0, {seq(T.i=Prod(Z, Set(T.(i+1))), i=0..m-1), T.m=Z}, unlabeled] end:A000235:=n -> count(ZL(3), size=n)-count(ZL(2), size=n): seq(A000235(n), n=1..36); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 23 2007
|
|
CROSSREFS
|
Adjacent sequences: A000232 A000233 A000234 this_sequence A000236 A000237 A000238
Sequence in context: A000713 A078409 A036642 this_sequence A006478 A104187 A131051
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
