|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|