login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A249906
a(n) is the index of the first occurrence of n in A249905, or -1 if n does not occur.
2
1, 0, -1, 3, 2, 5, 9, 13, 89, 485, 4891
OFFSET
1,4
COMMENTS
a(n) is the smallest number of Hamiltonian cycles up to direction which requires at least an n-vertex graph to realize.
LINKS
Erich Friedman, Math Magic (September 2012)
CROSSREFS
Sequence in context: A257878 A243700 A193796 * A258930 A002797 A049920
KEYWORD
sign,hard,more
AUTHOR
Jeremy Tan, Nov 08 2014
EXTENSIONS
a(10)-a(11) using data from Johan de Ruiter added by Jeremy Tan, Nov 02 2018
STATUS
approved