This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A186441 #32 Dec 23 2024 14:53:42 %S A186441 64,336,1672,8320,39616,186544,847520,3846192,16784384,72946352, %T A186441 304472976,1265186112 %N A186441 Number of n-vertex knight's tours on the 8x8 chessboard summed over all choices for the starting position. %D A186441 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 A186441 Ron Hardin, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2011-February/007150.html">Knight's tour A186441</a>, seqfan mailing list Feb 23 2011 %e A186441 a(1) = 64, since the knight cannot move. %o A186441 (PARI) a(n) = row(n,6)[6] \\ row(m,n) defined in A186851. - _Andrew Howroyd_, Jan 02 2023 %Y A186441 Cf. A001230. %Y A186441 Column 6 of A186851 %K A186441 nonn,fini,more %O A186441 1,1 %A A186441 _N. J. A. Sloane_, Feb 21 2011 %E A186441 a(5) to a(8) are tabulated here as computed by _R. H. Hardin_ and _D. S. McNeil_. %E A186441 Ambiguous a(0) removed by _Max Alekseyev_, Sep 22 2013 %E A186441 a(9)-a(12) from _Andrew Howroyd_, Jan 02 2023