|
Search: id:A061543
|
|
|
| A061543 |
|
Number of connected labeled graphs with n nodes and n+4 edges. |
|
+0
6
|
|
| 0, 0, 0, 0, 10, 2997, 343140, 28044072, 1969994376, 128916045720, 8189607254829, 516895556463000, 32865110582830812, 2123144102136625568, 140115162250240202025, 9478591551140049252096, 658706750876277003711720
(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.: W4(x) = - 1/11520*T(x)^5*( - 960 - 31632*T(x) - 54144*T(x)^2 + 100976*T(x)^3 - 117368*T(x)^4 + 79520*T(x)^5 - 35793*T(x)^6 + 10069*T(x)^7 - 1626*T(x)^8 + 108*T(x)^9)/(( - 1 + T(x))^12) 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: A047945 A132675 A123377 this_sequence A133198 A001329 A007101
Adjacent sequences: A061540 A061541 A061542 this_sequence A061544 A061545 A061546
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
RAVELOMANANA Vlady (vlad(AT)lri.fr), May 16 2001
|
|
|
Search completed in 0.002 seconds
|
