login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A283753
Irregular triangular array read by rows: T(n,k) is the number of non-isomorphic unlabeled weakly connected digraphs on n nodes and with k arcs.
3
1, 1, 1, 3, 4, 4, 1, 1, 8, 22, 37, 47, 38, 27, 13, 5, 1, 1, 27, 108, 326, 667, 1127, 1477, 1665, 1489, 1154, 707, 379, 154, 61, 16, 5, 1, 1, 91, 582, 2432, 7694, 19646, 42148, 77305, 122953, 170315, 206982, 220768, 207301, 171008, 124110, 78813, 43862, 21209, 8951, 3242, 1043, 288, 76, 17, 5, 1, 1, 350, 3024, 17314, 74676, 266364, 808620, 2144407
OFFSET
1,4
COMMENTS
The range for the subindex k is from n-1 to n(n-1).
Obtained from A054733 by removing leading zeros.
REFERENCES
E. Palmer and F. Harary, Graphical Enumeration, Academic Press, 1973.
EXAMPLE
First rows are:
1;
1, 1;
3, 4, 4, 1, 1;
8, 22, 37, 47, 38, 27, 13, 5, 1, 1;
27, 108, 326, 667, 1127, 1477, 1665, 1489, 1154, 707, 379, ...
PROG
(PARI) \\ See A054733 for G, InvEulerMTS.
row(n)={Vecrev(polcoef(InvEulerMTS(sum(i=0, n, G(i, y)*x^i, O(x*x^n))), n)/y^(n-1))}
{ for(n=1, 6, print(row(n))) } \\ Andrew Howroyd, Jan 28 2022
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Marko Riedel, Mar 15 2017
STATUS
approved