|
Search: id:A034855
|
|
|
| A034855 |
|
Triangle giving number of rooted labeled trees with n >= 2 nodes and height d>=1. |
|
+0
2
|
|
| 2, 3, 6, 4, 36, 24, 5, 200, 300, 120, 6, 1170, 3360, 2520, 720, 7, 7392, 38850, 43680, 22680, 5040, 8, 50568, 475776, 757680, 551040, 221760, 40320, 9, 372528, 6231960, 13747104, 12836880, 7136640, 2358720, 362880, 10, 2936070, 87530400, 264181680
(list; table; graph; listen)
|
|
|
OFFSET
|
0,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 trees
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
|
|
FORMULA
|
Reference gives recurrence.
|
|
EXAMPLE
|
2; 3 6; 4 36 24; 5 200 300 120; ...
|
|
CROSSREFS
|
Sequence in context: A137524 A096357 A091507 this_sequence A105214 A136315 A011159
Adjacent sequences: A034852 A034853 A034854 this_sequence A034856 A034857 A034858
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Pab Ter (pabrlos(AT)yahoo.com), May 27 2004
|
|
|
Search completed in 0.002 seconds
|
