A186441 Number of n-vertex knight's tours on the 8x8 chessboard summed over all choices for the starting position.
64, 336, 1672, 8320, 39616, 186544, 847520, 3846192, 16784384, 72946352, 304472976, 1265186112
Offset: 1
Examples
a(1) = 64, since the knight cannot move.
References
- L. Lant, A method for calculating the Knight's total tour count, Congress. Numerant., 202 (2010), 33-40. [Lant comments that "a(5)=40208 has not yet been verified."]
Links
- Ron Hardin, Knight's tour A186441, seqfan mailing list Feb 23 2011
Programs
-
PARI
a(n) = row(n,6)[6] \\ row(m,n) defined in A186851. - Andrew Howroyd, Jan 02 2023
Extensions
a(5) to a(8) are tabulated here as computed by R. H. Hardin and D. S. McNeil.
Ambiguous a(0) removed by Max Alekseyev, Sep 22 2013
a(9)-a(12) from Andrew Howroyd, Jan 02 2023