|
%I #9 Aug 29 2013 16:36:28
%S 0,1,1,1,3,3,7,9,18,31
%N Number of maximally nonhamiltonian graphs on n vertices.
%C Using the conventions than K_1 is Hamiltonian (so a(1) = 0) and K_2 is maximally nonhamiltonian (so a(2) = 1).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximallyNonhamiltonianGraph.html">Maximally Nonhamiltonian Graph</a>
%K nonn,hard,more
%O 1,5
%A _Eric W. Weisstein_, Aug 29 2013
|
