login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083386 Number (undirected) Hamiltonian paths in the 5 X n knight graph. 4

%I

%S 0,0,0,82,864,18784,622868,18061054,264895640,7886117822,128411926952,

%T 3611823644006,56348098488396,1548284436152798,24535910156176100,

%U 650456890341276338,10364916108987670024,267426031403733462626

%N Number (undirected) Hamiltonian paths in the 5 X n knight graph.

%C The number of (directed) knight's tours is twice this. - _Colin Rose_, Jun 12 2006

%D Jellis: http://home.freeuk.net/ktn/5a.htm [broken link ?]

%H Andrew Howroyd, <a href="/A083386/b083386.txt">Table of n, a(n) for n = 1..50</a>

%H Hochschule Mittweida, <a href="http://mathematik.htwm.de/software/gedit/index.html.en">Graph Editor</a>

%H C. Rose, <a href="http://www.tri.org.au/knightframe.html">The Distribution of the Knight</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>

%e There are 864 knight's tours on a 5 X 5 chessboard.

%Y Cf. A079137, A118067.

%K nonn

%O 1,4

%A André Pönitz (poenitz(AT)htwm.de), Jun 11 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 13 00:17 EST 2017. Contains 295954 sequences.