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”).
%I #10 Apr 16 2018 19:03:12
%S 0,0,1,16,120,9862
%N Number of longest cycles in the n X n knight graph.
%C a(8) = 13267364410532.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphCycle.html">Graph Cycle</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>
%F a(2*n) = A001230(n) for A001230(n) > 0. - _Andrew Howroyd_, Apr 16 2018
%Y Cf. A001230.
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, Mar 25 2018