cp's OEIS Frontend

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.

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

Original entry on oeis.org

0, 0, 0, 0, 3, 27, 315, 5693, 172141, 9176757
Offset: 1

Views

Author

Eric W. Weisstein, Dec 03 2015

Keywords

Comments

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

Links

  • Eric Weisstein's World of Mathematics, Ore Graph

Crossrefs

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.