login
Number of simple Hamiltonian graphs on n nodes which do not satisfy the Ore criterion for Hamiltonicity.
0

%I #14 Feb 20 2016 21:49:20

%S 0,0,0,0,3,27,315,5693,172141,9176757

%N Number of simple Hamiltonian graphs on n nodes which do not satisfy the Ore criterion for Hamiltonicity.

%C Using the "vacuous truth" convention so that complete graphs K_n are considered to be Ore graphs.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OreGraph.html">Ore Graph</a>

%Y Cf. A264683 (number of simple graphs which satisfy the Ore criterion for Hamiltonicity).

%Y Cf. A003216 (number of simple Hamiltonian graphs).

%K nonn,more

%O 1,5

%A _Eric W. Weisstein_, Dec 03 2015