|
Search: id:A003086
|
|
|
| A003086 |
|
Number of self-complementary digraphs with n nodes.
(Formerly M3404)
|
|
+0
6
|
|
| 1, 1, 4, 10, 136, 720, 44224, 703760, 179228736, 9168331776, 9383939974144, 1601371799340544, 6558936236286040064, 3837878966366932639744, 62879572771326489528942592, 128777257564337108286016980992
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, pp. 140, 243.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
|
|
CROSSREFS
|
Sequence in context: A153743 A098449 A118378 this_sequence A102958 A085649 A152396
Adjacent sequences: A003083 A003084 A003085 this_sequence A003087 A003088 A003089
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from R. C. Read (rcread(AT)math.uwaterloo.ca) and Vladeta Jovovic (vladeta(AT)eunet.rs).
|
|
|
Search completed in 0.002 seconds
|
