login
Number of (undirected) Hamiltonian paths in the n X n knight graph.
2

%I #10 Feb 16 2025 08:33:55

%S 0,0,0,0,864,3318960,82787609160,9795914085489952

%N Number of (undirected) Hamiltonian paths in the n X n knight graph.

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

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

%F a(n) = A165134(n)/2.

%Y Cf. A165134, A169696 (3 X n), A079137 (4 X n), A083386 (5 X n), A306281 (6 X n), A306283 (7 X n).

%K nonn,more,hard,changed

%O 1,5

%A _Eric W. Weisstein_, May 14 2019