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.

Showing 1-2 of 2 results.

A092199 Number of Ore graphs on n nodes using Skiena's nonstandard definition > n (instead of the usual >= n).

Original entry on oeis.org

0, 0, 0, 0, 2, 6, 32, 135, 1410
Offset: 1

Views

Author

Eric W. Weisstein, Feb 24 2004

Keywords

Crossrefs

Cf. A264683 (number of Ore graphs on n nodes).

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.

Crossrefs

Cf. A264683 (number of simple graphs which satisfy the Ore criterion for Hamiltonicity).
Cf. A003216 (number of simple Hamiltonian graphs).
Showing 1-2 of 2 results.