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
Andrew Howroyd, Table of n, a(n) for n = 0..50
R. C. Read, E. M. Wright, Colored graphs: A correction and extension, Canad. J. Math. 22 1970 594-596.
FORMULA
a(n) = m_n(2) using the functions defined in A002032. - Sean A. Irvine, May 29 2013
E.g.f.: log(A(x))+1 where A(x) is the e.g.f. for A047863. - Geoffrey Critzer, Sep 05 2013
Logarithmic transform of A047863. - Andrew Howroyd, Dec 03 2018
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
Corrected and extended by Sean A. Irvine, May 29 2013
Name clarified by Andrew Howroyd, Dec 03 2018
STATUS
editing