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 A083386 #20 Feb 16 2025 08:32:49 %S A083386 0,0,0,82,864,18784,622868,18061054,264895640,7886117822,128411926952, %T A083386 3611823644006,56348098488396,1548284436152798,24535910156176100, %U A083386 650456890341276338,10364916108987670024,267426031403733462626 %N A083386 Number (undirected) Hamiltonian paths in the 5 X n knight graph. %C A083386 The number of (directed) knight's tours is twice this. - _Colin Rose_, Jun 12 2006 %D A083386 Jellis: http://home.freeuk.net/ktn/5a.htm [broken link ?] %H A083386 Andrew Howroyd, <a href="/A083386/b083386.txt">Table of n, a(n) for n = 1..50</a> %H A083386 Hochschule Mittweida, <a href="http://mathematik.htwm.de/software/gedit/index.html.en">Graph Editor</a> %H A083386 C. Rose, <a href="http://www.tri.org.au/knightframe.html">The Distribution of the Knight</a> %H A083386 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a> %H A083386 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a> %e A083386 There are 864 knight's tours on a 5 X 5 chessboard. %Y A083386 Cf. A079137, A118067. %K A083386 nonn %O A083386 1,4 %A A083386 André Pönitz (poenitz(AT)htwm.de), Jun 11 2003