|
Search: id:A061542
|
|
|
| A061542 |
|
Number of connected labeled graphs with n nodes and n+3 edges. |
|
+0
7
|
|
| 0, 0, 0, 0, 45, 4945, 331506, 18602136, 974679363, 50088981600, 2588876118675, 136440380444544, 7389687834858186, 413138671455654144, 23901631262740105875, 1432747304604594800640, 89030607737889046580442
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
S. Janson, D. E. Knuth, T. Luczak and B. Pittel, The Birth of the Giant Component, Random Structures and Algorithms Vol. 4 (1993), 233-358.
E. M. Wright, The Number of Connected Sparsely Edged Graphs, Journal of Graph Theory Vol. 1 (1977), 317-330.
|
|
FORMULA
|
E.g.f.: W2(x) = 1/5760*T(x)^5*(2160 + 9320*T(x) - 12576*T(x)^2 + 9864*T(x)^3 - 4081*T(x)^4 + 914*T(x)^5 - 76*T(x)^6)/((1 - T(x))^9), where T(x) is the e.g.f. for rooted labeled trees (A000169), i.e. T(x) = - LambertW( - x) = x*exp(T(x)).
|
|
CROSSREFS
|
Cf. A000169, A000272.
Sequence in context: A036521 A093533 A101291 this_sequence A037182 A134229 A163035
Adjacent sequences: A061539 A061540 A061541 this_sequence A061543 A061544 A061545
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
RAVELOMANANA Vlady (vlad(AT)lri.fr), May 16 2001
|
|
|
Search completed in 0.002 seconds
|
