|
Search: id:A000526
|
|
|
| A000526 |
|
Partially labeled trees with n nodes (5 of which are labeled).
(Formerly M5387 N2340)
|
|
+0
9
|
|
| 125, 1296, 8716, 47787, 232154, 1040014, 4395772, 17781210, 69498964, 264248924, 982218072, 3582421612, 12857819052, 45515994861, 159205157535, 551049504784, 1889714853263, 6427147635062, 21698583468717
(list; graph; listen)
|
|
|
OFFSET
|
5,1
|
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 138.
|
|
LINKS
|
Index entries for sequences related to trees
|
|
FORMULA
|
G.f.: A(x) = B(x)^5*(125-204*B(x)+118*B(x)^2-24*B(x)^3)/(1-B(x))^7, where B(x) is g.f. for rooted trees with n nodes, cf. A000081.
|
|
CROSSREFS
|
Cf. A000055, A000107, A000243, A000269, A000444, A000485, A000524, A000525.
Sequence in context: A016815 A088896 A016851 this_sequence A016971 A030082 A017043
Adjacent sequences: A000523 A000524 A000525 this_sequence A000527 A000528 A000529
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 19 2001
|
|
|
Search completed in 0.002 seconds
|
