%I A126149
%S A126149 1,2,4,11,34,156,1044,12346,274668,2411453,123544541
%N A126149 Number of connected nonhamiltonian graphs with n nodes.
%C A126149 There are no nonhamiltonian graphs on 9 or fewer nodes.
%D A126149 J. P. Dolch, Names of Hamiltonian graphs, Proc. 4th S-E Conf. Combin., 
               Graph Theory, Computing, Congress. Numer. 8 (1973), 259-271.
%D A126149 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, p. 219.
%H A126149 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               NonhamiltonianGraph.html">Nonhamiltonian Graph</a>.
%F A126149 a(n) = A001349(n) - A003216(n). For n<10 a(n) = A001349.
%e A126149 a(10) = A001349(10) - A003216(10) = number of connected graphs on 10 
               unlabeled nodes - number of Hamiltonian graphs with 10 nodes = 11716571 
               - 9305118 = 2411453.
%e A126149 a(11) = A001349(11) - A003216(11) = number of connected graphs on 11 
               unlabeled nodes - number of Hamiltonian graphs with 11 nodes = 1006700565 
               - 883156024 = 123544541.
%Y A126149 Cf. A000088, A001349, A003216, A022564.
%Y A126149 Sequence in context: A076319 A076320 A076321 this_sequence A000088 A071794 
               A107378
%Y A126149 Adjacent sequences: A126146 A126147 A126148 this_sequence A126150 A126151 
               A126152
%K A126149 nonn
%O A126149 1,2
%A A126149 Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 07 2007