|
%I #17 Feb 28 2016 10:55:16
%S 1,1,1,3,5,21,68,503,4942,128361
%N Number of simple graphs on n nodes which satisfy the Ore criterion for Hamiltonicity.
%C Includes complete graphs K_n according to the "vacuous truth" convention that statements like "for all X in Y: P(X)" are true if Y is the empty set.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OreGraph.html">Ore Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OresTheorem.html">Ore's Theorem</a>
%Y Cf. A264683 (number of Hamiltonian graphs not satisfying Ore's criterion).
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, Dec 03 2015
| 