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

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,3

Links

Table of n, a(n) for n=1..49.

Erich Friedman, Math Magic (September 2012)

Example

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.

Sequence in context: A085824 A351290 A374249 * A014157 A026467 A088185

Adjacent sequences: A244508 A244509 A244510 * A244512 A244513 A244514

Keyword

nonn,fini,full

Author

Jeremy Tan, Nov 11 2014

Status

approved