|
Search: id:A000107
|
|
|
| A000107 |
|
Number of rooted trees with n nodes and a single labeled node; pointed rooted trees; vertebrates.
(Formerly M1442 N0570)
|
|
+0
14
|
|
| 0, 1, 2, 5, 13, 35, 95, 262, 727, 2033, 5714, 16136, 45733, 130046, 370803, 1059838, 3035591, 8710736, 25036934, 72069134, 207727501, 599461094, 1731818878, 5008149658, 14496034714, 41993925955, 121747732406
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 134.
F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 61, 62 (2.1.8-2.1.10)
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..200
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
N. J. A. Sloane, Transforms
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 123
|
|
CROSSREFS
|
INVERT transform of A000081. Cf. A000243, A000269, A000312, A000444, A000485, A000524-A000526.
Sequence in context: A024576 A057960 A007075 this_sequence A063028 A085810 A005773
Adjacent sequences: A000104 A000105 A000106 this_sequence A000108 A000109 A000110
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Better description from Christian G. Bower (bowerc(AT)usa.net), Apr 15 1998.
|
|
|
Search completed in 0.002 seconds
|
