|
|
A002027
|
|
Number of connected graphs on n labeled nodes, each node being colored with one of 2 colors, such that no edge joins nodes of the same color.
(Formerly M0365 N0138)
|
|
5
|
|
|
1, 2, 2, 6, 38, 390, 6062, 134526, 4172198, 178449270, 10508108222, 853219059726, 95965963939958, 15015789392011590, 3282145108526132942, 1005193051984479922206, 432437051675617901246918, 261774334771663762228012950, 223306437526333657726283273822
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is the number of connected labeled graphs with n 2-colored nodes where black nodes are only connected to white nodes and vice versa. - Geoffrey Critzer, Sep 05 2013
|
|
REFERENCES
|
R. C. Read, personal communication.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
nn=10; f[x_]:=Sum[Sum[Binomial[n, k]2^(k(n-k)), {k, 0, n}]x^n/n!, {n, 0, nn}]; Range[0, nn]!CoefficientList[Series[Log[f[x]]+1, {x, 0, nn}], x] (* Geoffrey Critzer, Sep 05 2013 *)
|
|
PROG
|
(PARI) seq(n)={Vec(serlaplace(1 + log(serconvol(sum(j=0, n, x^j*2^binomial(j, 2)) + O(x*x^n), (sum(j=0, n, x^j/(j!*2^binomial(j, 2))) + O(x*x^n))^2))))} \\ Andrew Howroyd, Dec 03 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|