%I A003216 M2764
%S A003216 1,0,1,3,8,48,383,6196,177083,9305118,883156024
%N A003216 Number of Hamiltonian graphs with n nodes.
%C A003216 a(1) could also be taken to be 0, but I prefer a(1) = 1. - N. J. A. Sloane 
               (njas(AT)research.att.com), Oct 15 2006
%D A003216 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003216 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, p. 219.
%D A003216 J. P. Dolch, Names of Hamiltonian graphs, Proc. 4th S-E Conf. Combin., 
               Graph Theory, Computing, Congress. Numer. 8 (1973), 259-271.
%D A003216 Extended to n=11 by Brendan McKay (bdm(AT)cs.anu.edu.au), Jul 15 1996.
%D A003216 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%H A003216 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               HamiltonianGraph.html">Link to a section of The World of Mathematics.</
               a>
%Y A003216 Sequence in context: A019016 A063859 A034183 this_sequence A146161 A019015 
               A000862
%Y A003216 Adjacent sequences: A003213 A003214 A003215 this_sequence A003217 A003218 
               A003219
%K A003216 nonn,nice,hard
%O A003216 1,4
%A A003216 N. J. A. Sloane (njas(AT)research.att.com).