OFFSET
0,3
REFERENCES
R. W. Robinson, Counting labeled acyclic digraphs, pp. 263-264 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..50
Qipeng Kuang, Ondřej Kuželka, Yuanhong Wang, and Yuyi Wang, Bridging Weighted First Order Model Counting and Graph Polynomials, arXiv:2407.11877 [cs.LO], 2024. See p. 33.
FORMULA
PROG
(PARI) \\ here G(n) is A003024 as e.g.f.
G(n)={my(v=vector(n+1)); v[1]=1; for(n=1, n, v[n+1]=sum(k=1, n, -(-1)^k*2^(k*(n-k))*v[n-k+1]/k!))/n!; Ser(v)}
{ concat([0], Vec(serlaplace(log(G(15))))) } \\ Andrew Howroyd, Sep 10 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Apr 15 2003
STATUS
approved