a(n) is the smallest number of Hamiltonian cycles up to direction which requires at least an n-vertex graph to realize.
Table of n, a(n) for n=1..11.
Erich Friedman, Math Magic (September 2012)
Sequence in context: A257878 A243700 A193796 * A258930 A002797 A049920
Adjacent sequences: A249903 A249904 A249905 * A249907 A249908 A249909
Jeremy Tan, Nov 08 2014
a(10)-a(11) using data from Johan de Ruiter added by Jeremy Tan, Nov 02 2018