|
Search: id:A000525
|
|
|
| A000525 |
|
Partially labeled rooted trees with n nodes (4 of which are labeled).
(Formerly M5329 N2317)
|
|
+0
8
|
|
| 64, 625, 4016, 21256, 100407, 439646, 1823298, 7258228, 27983518, 105146732, 386812476, 1398023732, 4977320988, 17492710572, 60790051789, 209179971147, 713533304668, 2415061934763, 8117293752058, 27111950991825, 90039381031273
(list; graph; listen)
|
|
|
OFFSET
|
4,1
|
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 134.
|
|
LINKS
|
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
|
|
FORMULA
|
G.f.: A(x) = B(x)^4*(64-79*B(x)+36*B(x)^2-6*B(x)^3)/(1-B(x))^7, where B(x) is g.f. for rooted trees with n nodes, cf. A000081.
|
|
CROSSREFS
|
Cf. A000081, A000107, A000243, A000269, A000444, A000485, A000524, A000526.
Cf. A042977.
Sequence in context: A100415 A070054 A045789 this_sequence A067476 A138332 A091083
Adjacent sequences: A000522 A000523 A000524 this_sequence A000526 A000527 A000528
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 19 2001
|
|
|
Search completed in 0.002 seconds
|
