login
A335356
Number of ways to linearly order the connected components of a simple labeled graph on n nodes.
1
1, 1, 3, 16, 136, 1878, 47370, 2510396, 291566024, 71549525888, 35928299706224, 36432215193597408, 74229008389424439216, 303202179866531643034192, 2480138500144153722933893296, 40602085162301271195431005565536, 1329878225405871291410633661227157760
OFFSET
0,3
FORMULA
E.g.f.: 1/(1-log(g(x))), where g(x) is the e.g.f. for A006125.
MATHEMATICA
nn = 16; g[x_] := Sum[2^Binomial[n, 2] x^n/n!, {n, 0, nn}]; Table[n!, {n, 0, nn}] CoefficientList[Series[1/(1 - Log[g[x]]), {x, 0, nn}], x]
CROSSREFS
KEYWORD
nonn
AUTHOR
Geoffrey Critzer, Jun 04 2020
STATUS
approved