|
Search: id:A058915
|
|
|
| A058915 |
|
Number of graphs with 3 distinct components. |
|
+0
1
|
|
| 2, 7, 34, 181, 1266, 14106, 293756, 12362198, 1032671168, 166176421788, 50672459139597, 29105501987344357, 31455795559882541775, 64032588337815572241795, 246000022800939308314311897
(list; graph; listen)
|
|
|
OFFSET
|
6,1
|
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, page 48, (2.6.3).
|
|
FORMULA
|
G.f.: 1/6*(f(x)^3-3*f(x)*f(x^2)+2*f(x^3)), where f(x)=g(x)-1 and g(x) is g.f. for connected graphs. Cf. A001349.
|
|
CROSSREFS
|
Cf. A001349.
Sequence in context: A020103 A014623 A023053 this_sequence A020054 A117399 A056543
Adjacent sequences: A058912 A058913 A058914 this_sequence A058916 A058917 A058918
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 11 2001
|
|
|
Search completed in 0.002 seconds
|
