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 Jul 08 2023 15:36:52
%S 0,1,222,128769,959427728,110346440462642
%N Numbers of undirected cycles in the n X n knight graph.
%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>
%t Table[Length[FindCycle[KnightTourGraph[n, n], Infinity, All]], {n, 5}]
%K nonn
%O 2,3
%A _Eric W. Weisstein_, Dec 28 2013
%E a(7) from _Ed Wynn_, Jul 08 2023