%I A002499 M2875 N1156
%S A002499 1,3,10,70,708,15224,544152,39576432,5074417616,1296033011648,
%T A002499 604178966756320,556052774253161600,954895322019762585664,
%U A002499 3224152068625567826724224,20610090531322819956330186112
%N A002499 Number of self-converse digraphs with n nodes.
%D A002499 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002499 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002499 F. Harary and E. M. Palmer, Enumeration of self-converse digraphs, Mathematika, 
               13 (1966), 151-157.
%D A002499 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, p. 155, Table 6.6.1 (but the last entry is wrong).
%D A002499 R. W. Robinson, personal communication.
%D A002499 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.
%H A002499 R. W. Robinson, <a href="b002499.txt">Table of n, a(n) for n = 1..28</
               a>
%Y A002499 Cf. A002500.
%Y A002499 Sequence in context: A072638 A080526 A143083 this_sequence A047833 A047834 
               A136507
%Y A002499 Adjacent sequences: A002496 A002497 A002498 this_sequence A002500 A002501 
               A002502
%K A002499 nonn,nice
%O A002499 1,2
%A A002499 N. J. A. Sloane (njas(AT)research.att.com).
%E A002499 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 17 2000