This site is supported by donations to The OEIS Foundation.



Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035512 Number of unlabeled strongly connected digraphs with n nodes. 11
1, 1, 1, 5, 83, 5048, 1047008, 705422362, 1580348371788, 12139024825260556, 328160951349343885604, 31831080872412589394328804, 11234274997368899732057135454531, 14576252633139820879894296847900227082 (list; graph; refs; listen; history; text; internal format)



F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 218.

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

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.


R. W. Robinson, Table of n, a(n) for n = 0..18

A. M. Hinz, S. Klavžar, U. Milutinović, C. Petr, The Tower of Hanoi - Myths and Maths, Birkhäuser 2013. See page 251. Book's website

Eric Weisstein's World of Mathematics, Strongly Connected Digraph.


Cf. A003030.

Sequence in context: A082546 A173876 A250549 * A054953 A215172 A301811

Adjacent sequences:  A035509 A035510 A035511 * A035513 A035514 A035515




R. C. Read (rcread(AT)math.uwaterloo.ca)


a(12) and a(13) added by N. J. A. Sloane from the Robinson report, Oct 17 2006



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 January 18 01:36 EST 2019. Contains 319260 sequences. (Running on oeis4.)