%I A035512
%S A035512 1,1,1,5,83,5048,1047008,705422362,1580348371788,12139024825260556,
%T A035512 328160951349343885604,31831080872412589394328804,
%U A035512 11234274997368899732057135454531,14576252633139820879894296847900227082
%N A035512 Number of unlabeled strongly connected digraphs with n nodes.
%D A035512 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, p. 218.
%D A035512 V. A. Liskovets, A contribution to the enumeration of strongly connected 
               digraphs, Dokl. AN BSSR, 17 (1973), 1077-1080, MR49#4849.
%D A035512 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%D A035512 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%H A035512 R. W. Robinson, <a href="b035512.txt">Table of n, a(n) for n = 0..18</
               a>
%H A035512 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               StronglyConnectedDigraph.html">Link to a section of The World of 
               Mathematics.</a>
%Y A035512 Cf. A003030.
%Y A035512 Sequence in context: A163011 A142162 A082546 this_sequence A054953 A111834 
               A006471
%Y A035512 Adjacent sequences: A035509 A035510 A035511 this_sequence A035513 A035514 
               A035515
%K A035512 nonn,nice
%O A035512 0,4
%A A035512 R. C. Read (rcread(AT)math.uwaterloo.ca)
%E A035512 a(12) and a(13) added by N. J. A. Sloane (njas(AT)research.att.com) from 
               the Robinson report, Oct 17 2006