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

Author

Johan de Ruiter, May 27 2018

Keywords

• nonn
• more

Examples

			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.
		

Links

• Erich Friedman, Math Magic (September 2012)

Crossrefs

Cf. A244511.