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!)
A049387 Number of rooted unlabeled strongly connected digraphs with n nodes. 1
1, 1, 10, 287, 24427 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

There is a rather difficult formula (simplified in 1973). The subsequent published value 6222928 for n=6 needs to be verified.

LINKS

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

V. A. Liskovets, The number of strongly connected directed graphs, Mat. Notes, 8 (1970), 877-882

CROSSREFS

Cf. A035512.

Sequence in context: A213403 A077281 A239774 * A222672 A024295 A291658

Adjacent sequences:  A049384 A049385 A049386 * A049388 A049389 A049390

KEYWORD

nonn

AUTHOR

Valery A. Liskovets

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 June 6 01:16 EDT 2020. Contains 334858 sequences. (Running on oeis4.)