%I
%S 0,1,222,128769,959427728
%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
