|
|
A121251
|
|
Number of labeled graphs without isolated vertices and with n edges.
|
|
7
|
|
|
1, 1, 6, 62, 900, 16824, 384668, 10398480, 324420840, 11472953760, 453518054216, 19815916826160, 948348447031440, 49334804947402800, 2771902062752597520, 167281797371598801136, 10791777047497882651296, 741135302021991803931360
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) ~ C0*(C1*n)^n, where C0 = 1/2^(1+log(2)/4)/log(2) = 0.63970540489176946794... and C1 = 2/(log(2))^2/exp(1) = 1.5313857152078346894..., [Bender et al.]
|
|
REFERENCES
|
E. A. Bender, E. R. Canfield and B. D. McKay, The asymptotic number of labeled
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{m>=0} binomial(binomial(m,2),n)/2^(m+1). Column sums of A054548.
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|