|
|
A182100
|
|
The number of connected simple labeled graphs with <= n nodes.
|
|
3
|
|
|
1, 2, 4, 11, 65, 974, 31744, 2069971, 267270041, 68629753650, 35171000942708, 36024807353574291, 73784587576805254665, 302228602363365451957806, 2475873310144021668263093216, 40564787336902311168400640561099
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{i=0..n} binomial(n,i)*A001187(i).
E.g.f.: exp(x)*A(x) where A(x) is e.g.f. for A001187.
|
|
EXAMPLE
|
The a(0) = 1 through a(3) = 11 edge-sets (singletons represent uncovered vertices):
{} {} {} {}
{{1}} {{1}} {{1}}
{{2}} {{2}}
{{1,2}} {{3}}
{{1,2}}
{{1,3}}
{{2,3}}
{{1,2},{1,3}}
{{1,2},{2,3}}
{{1,3},{2,3}}
{{1,2},{1,3},{2,3}}
(End)
|
|
MATHEMATICA
|
nn = 15; g = Sum[2^Binomial[n, 2] x^n/n!, {n, 0, nn}]; Range[0, nn]! CoefficientList[Series[Exp[x] (Log[g] + 1), {x, 0, nn}], x]
|
|
CROSSREFS
|
The unlabeled version is A292300(n) + 1.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|