A305190 a(n) is the number of different numbers of Hamiltonian cycles (up to direction) in graphs with n vertices.

1, 1, 2, 3, 6, 16, 49, 232, 1351, 10367

Offset

1,3

Links

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

Erich Friedman, Math Magic (September 2012)

Example

A graph on 4 vertices can have either 0, 1 or 3 Hamiltonian cycles (up to direction), which are 3 numbers, so a(4)= 3.

Crossrefs

Cf. A244511.

Sequence in context: A284417 A219024 A145860 * A087983 A340911 A328409

Adjacent sequences: A305187 A305188 A305189 * A305191 A305192 A305193

Keyword

nonn,more

Author

Johan de Ruiter, May 27 2018

Status

approved