|
Search: id:A004114
|
|
|
| A004114 |
|
Number of trees with n nodes and 2-colored internal (non-leaf) nodes.
(Formerly M1422)
|
|
+0
4
|
|
| 1, 1, 1, 2, 5, 12, 33, 98, 305, 1002, 3424, 12016, 43230, 158516, 590621, 2230450, 8521967, 32889238, 128064009, 502590642, 1986357307, 7900377892, 31602819524, 127076645038, 513419837168, 2083414420394, 8488377206876
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
F. Harary, R. W. Robinson and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc., Series A, 20 (1975), 483-503. Errata: Vol. A 41 (1986), p. 325.
|
|
LINKS
|
Index entries for sequences related to trees
|
|
FORMULA
|
G.f.: 1+B(x)-x*B(x)-B(x)^2/2+B(x^2)/2 where B(x) is g.f. of A004113.
|
|
CROSSREFS
|
Cf. A004113, A052316, A052317.
Adjacent sequences: A004111 A004112 A004113 this_sequence A004115 A004116 A004117
Sequence in context: A000560 A032124 A000669 this_sequence A076864 A032292 A121956
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms, formula and new description from Christian G. Bower (bowerc(AT)usa.net), Dec 15 1999.
|
|
|
Search completed in 0.002 seconds
|
