login
A301649
Number of longest cycles in the n X n knight graph.
0
0, 0, 1, 16, 120, 9862
OFFSET
1,4
COMMENTS
a(8) = 13267364410532.
LINKS
Eric Weisstein's World of Mathematics, Graph Cycle
Eric Weisstein's World of Mathematics, Knight Graph
FORMULA
a(2*n) = A001230(n) for A001230(n) > 0. - Andrew Howroyd, Apr 16 2018
CROSSREFS
Cf. A001230.
Sequence in context: A027049 A060219 A185760 * A014732 A135794 A161851
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Mar 25 2018
STATUS
approved