A391009 Number of (undirected) Hamiltonian paths on the 9 X n knight graph.

0, 0, 560, 189688, 264895640, 1770631206422, 2903212163753000, 6132937892156709562

Offset

1,3

Links

Table of n, a(n) for n=1..8.

Peter Luschny, Counting Knight's Tours, C++ implementation.

Prog

(C++) // Cf. links.

Crossrefs

Cf. A390833.

Sequence in context: A193171 A013487 A229389 * A167822 A104590 A259211

Adjacent sequences: A391006 A391007 A391008 * A391010 A391011 A391012

Keyword

nonn,hard,more

Author

Peter Luschny, Dec 18 2025

Status

approved