The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #15 Feb 16 2025 08:33:27
%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="https://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