|
|
A003030
|
|
Number of strongly connected digraphs with n labeled nodes.
(Formerly M5064)
|
|
33
|
|
|
1, 1, 18, 1606, 565080, 734774776, 3523091615568, 63519209389664176, 4400410978376102609280, 1190433705317814685295399296, 1270463864957828799318424676767488, 5381067966826255132459611681511359329536, 90765788839403090457244128951307413371883494400
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
As usual, there can be an edge both from i to j and from j to i.
|
|
REFERENCES
|
Archer, K., Gessel, I. M., Graves, C., & Liang, X. (2020). Counting acyclic and strong digraphs by descents. Discrete Mathematics, 343(11), 112041.
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, p. 428.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
R. W. Robinson, Counting labeled acyclic digraphs, pp. 239-273 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3) = 18 (the symbol = denotes a pair of parallel edges): 1->2->3->1 (2 such); 1=2->3->1 (6); 1=2=3->1 (6); 1=2=3=1 (1); 1=2=3 (3).
|
|
MAPLE
|
option remember;
if n =1 then
1;
else
A054947(n)+add(binomial(n-1, t-1)*procname(t)*A054947(n-t), t=1..n-1) ;
end if;
end proc:
|
|
MATHEMATICA
|
b[1]=1; b[n_]:=b[n]=2^(n*(n-1))-Sum[Binomial[n, j]*2^((n-1)*(n-j))*b[j], {j, 1, n-1}];
a[1]=1; a[n_]:=a[n]=b[n]+Sum[Binomial[n-1, j-1]*b[n-j]*a[j], {j, 1, n-1}];
|
|
PROG
|
(PARI) \\ here B(n) is A054947 as vector.
B(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=2^(n*(n-1))-sum(j=1, n-1, binomial(n, j)*2^((n-1)*(n-j))*v[j])); v}
seq(n)={my(u=B(n), v=vector(n)); v[1]=1; for(n=2, #v, v[n]=u[n]+sum(j=1, n-1, binomial(n-1, j-1)*u[n-j]*v[j])); v} \\ Andrew Howroyd, Sep 10 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|