|
Search: id:A034854
|
|
|
| A034854 |
|
Triangle giving number of rooted labeled trees with n >= 3 nodes and diameter d>=2. |
|
+0
1
|
|
| 3, 4, 12, 5, 60, 60, 6, 210, 720, 360, 7, 630, 6090, 7560, 2520, 8, 1736, 47040, 112560, 80640, 20160, 9, 4536, 363384, 1496880, 1829520, 907200, 181440, 10, 11430, 2913120, 19207440, 36892800, 28274400, 10886400, 1814400
(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
|
J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.
Index entries for sequences related to trees
|
|
FORMULA
|
Reference gives recurrence.
|
|
EXAMPLE
|
3; 4 12; 5 60 60; 6 210 720 360; 7 630 6090 7560 2520; ...
|
|
CROSSREFS
|
Sequence in context: A045826 A084200 A097850 this_sequence A164982 A081837 A101404
Adjacent sequences: A034851 A034852 A034853 this_sequence A034855 A034856 A034857
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Pab Ter (pabrlos(AT)yahoo.com), May 27 2004
|
|
|
Search completed in 0.002 seconds
|
