login
Numbers of undirected cycles in the n X n knight graph.
5

%I #11 Feb 16 2025 08:33:21

%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="https://mathworld.wolfram.com/GraphCycle.html">Graph Cycle</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>

%t Table[Length[FindCycle[KnightTourGraph[n, n], Infinity, All]], {n, 5}]

%K nonn,changed

%O 2,3

%A _Eric W. Weisstein_, Dec 28 2013

%E a(7) from _Ed Wynn_, Jul 08 2023