|
|
A058874
|
|
Number of 4-colored labeled graphs with n nodes.
|
|
3
|
|
|
0, 0, 0, 64, 5120, 450560, 56197120, 10877927424, 3407830056960, 1765179884830720, 1528596578057584640, 2225354662890778394624, 5460264388115266042593280, 22602991882128566753395998720, 157891665026904821204431467970560
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 18, Table 1.5.1.
|
|
LINKS
|
|
|
MATHEMATICA
|
m = 16;
CoefficientList[Sum[x^j*j!*2^Binomial[j, 2], {j, 1, m}] + O[x]^n, x]* CoefficientList[(Sum[x^j/(j!*2^Binomial[j, 2]), {j, 1, n}] + O[x]^m)^4/24 + O[x]^m, x] // Rest (* Jean-François Alcover, Sep 06 2019, from PARI *)
|
|
PROG
|
(PARI) seq(n)={Vec(serconvol(sum(j=1, n, x^j*j!*2^binomial(j, 2)) + O(x*x^n), (sum(j=1, n, x^j/(j!*2^binomial(j, 2))) + O(x*x^n))^4)/24, -n)} \\ Andrew Howroyd, Nov 30 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|