%I A003086 M3404
%S A003086 1,1,4,10,136,720,44224,703760,179228736,9168331776,9383939974144,
%T A003086 1601371799340544,6558936236286040064,3837878966366932639744,
%U A003086 62879572771326489528942592,128777257564337108286016980992
%N A003086 Number of self-complementary digraphs with n nodes.
%D A003086 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003086 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, pp. 140, 243.
%D A003086 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%Y A003086 Sequence in context: A153743 A098449 A118378 this_sequence A102958 A085649 
               A152396
%Y A003086 Adjacent sequences: A003083 A003084 A003085 this_sequence A003087 A003088 
               A003089
%K A003086 nonn,nice,easy
%O A003086 1,3
%A A003086 N. J. A. Sloane (njas(AT)research.att.com).
%E A003086 More terms from R. C. Read (rcread(AT)math.uwaterloo.ca) and Vladeta 
               Jovovic (vladeta(AT)eunet.rs).