login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054951 Number of unlabeled semi-strong digraphs on n nodes with mutually nonisomorphic components. 3
1, 1, 4, 78, 4960, 1041872, 704369984, 1579641879248, 12137443766888448, 328148810741254606592, 31830752699315833628787200, 11234243165959817684710307801600, 14576241398832991116522929933694031872, 70075699209573863790264288901653500497274880 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

V. A. Liskovets, A contribution to the enumeration of strongly connected digraphs, Dokl. AN BSSR, 17 (1973), 1077-1080 (Russian), MR49#4849.

LINKS

Table of n, a(n) for n=1..14.

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

FORMULA

G.f.: 1 - Product_{n > 0} (1 - x^n)^A035512(n). - Andrew Howroyd, Sep 10 2018

MATHEMATICA

m = 15;

A035512 = Cases[Import["https://oeis.org/A035512/b035512.txt", "Table"], {_, _}][[All, 2]];

gf = 1 - Product[(1 - x^n)^A035512[[n + 1]], {n, 1, m}];

CoefficientList[gf + O[x]^m , x] // Rest (* Jean-Fran├žois Alcover, Aug 26 2019, after Andrew Howroyd *)

CROSSREFS

Cf. A035512, A049387, A054952, A054953, A054954.

Sequence in context: A220240 A246606 A210903 * A215843 A048957 A006425

Adjacent sequences:  A054948 A054949 A054950 * A054952 A054953 A054954

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic, Mar 11 2003

a(12)-a(14) from Andrew Howroyd, Sep 10 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:41 EDT 2021. Contains 343089 sequences. (Running on oeis4.)