|
| |
|
|
A003086
|
|
Number of self-complementary digraphs with n nodes.
(Formerly M3404)
|
|
5
| |
|
|
1, 1, 4, 10, 136, 720, 44224, 703760, 179228736, 9168331776, 9383939974144, 1601371799340544, 6558936236286040064, 3837878966366932639744, 62879572771326489528942592, 128777257564337108286016980992
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| 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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
CROSSREFS
| Sequence in context: A118378 A203224 A198156 * A102958 A085649 A152396
Adjacent sequences: A003083 A003084 A003085 * 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).
|
| |
|
|
