This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A264683 #18 Feb 16 2025 08:33:27 %S A264683 1,1,1,3,5,21,68,503,4942,128361 %N A264683 Number of simple graphs on n nodes which satisfy the Ore criterion for Hamiltonicity. %C A264683 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 A264683 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OreGraph.html">Ore Graph</a> %H A264683 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OresTheorem.html">Ore's Theorem</a> %Y A264683 Cf. A264683 (number of Hamiltonian graphs not satisfying Ore's criterion). %K A264683 nonn,more %O A264683 1,4 %A A264683 _Eric W. Weisstein_, Dec 03 2015