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.

A244511 Possible numbers of Hamiltonian cycles up to direction in 7-vertex graphs.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 26, 27, 28, 30, 32, 33, 34, 36, 38, 40, 45, 48, 52, 60, 62, 70, 72, 76, 80, 90, 108, 120, 144, 168, 240, 360
Offset: 1

Views

Author

Jeremy Tan, Nov 11 2014

Keywords

Examples

			The empty graph on 7 vertices has no Hamiltonian cycles, so a(1) = 0. The cycle graph C_7 has exactly one so a(2) = 1.
		

Crossrefs

Cf. A249905 (for the definition of "up to direction"), A249906, A253648 (numbers of Hamiltonian cycles that are not possible in 8-vertex graphs), A305190.