|
%I #31 Jan 24 2023 10:08:11
%S 64,336,1672,8320,39616,186544,847520,3846192,16784384,72946352,
%T 304472976,1265186112
%N Number of n-vertex knight's tours on the 8x8 chessboard summed over all choices for the starting position.
%D 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."]
%H Ron Hardin, <a href="http://list.seqfan.eu/oldermail/seqfan/2011-February/007150.html">Knight's tour A186441</a>, seqfan mailing list Feb 23 2011
%e a(1) = 64, since the knight cannot move.
%o (PARI) a(n) = row(n,6)[6] \\ row(m,n) defined in A186851. - _Andrew Howroyd_, Jan 02 2023
%Y Cf. A001230.
%Y Column 6 of A186851
%K nonn,fini,more
%O 1,1
%A _N. J. A. Sloane_, Feb 21 2011
%E a(5) to a(8) are tabulated here as computed by _R. H. Hardin_ and _D. S. McNeil_.
%E Ambiguous a(0) removed by _Max Alekseyev_, Sep 22 2013
%E a(9)-a(12) from _Andrew Howroyd_, Jan 02 2023
|
