[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130768
Number of minimally strongly connected digraphs on n labeled vertices.
0
1, 5, 58, 1069, 27816, 943669, 39757264, 2010923289, 119153235520, 8118839891161, 627023347399296, 54258093698028037
(list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
REFERENCES
Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.
LINKS
Table of n, a(n) for n=2..13.
CROSSREFS
Cf. A130756.
Sequence in context: A151424 A097631 A365013 * A195947 A371329 A156326
Adjacent sequences: A130765 A130766 A130767 * A130769 A130770 A130771
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Jul 13 2007
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 16 10:11 EST 2024. Contains 377785 sequences.
License Agreements, Terms of Use, Privacy Policy