|
Search: id:A049387
|
|
|
| A049387 |
|
Number of rooted unlabeled strongly connected digraphs with n nodes. |
|
+0
2
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
There is a rather difficult formula (simplified in 1973). The subsequent published value 6222928 for n=6 needs to be verified.
|
|
REFERENCES
|
V. A. Liskovets, The number of strongly connected directed graphs, Mat. Notes, 8 (1970), 877-882.
|
|
CROSSREFS
|
Cf. A035512.
Sequence in context: A025035 A012243 A077281 this_sequence A024295 A159960 A059072
Adjacent sequences: A049384 A049385 A049386 this_sequence A049388 A049389 A049390
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
V. A. Liskovets (liskov(AT)im.bas-net.by)
|
|
|
Search completed in 0.002 seconds
|
