login
A083386
Number (undirected) Hamiltonian paths in the 5 X n knight graph.
7
0, 0, 0, 82, 864, 18784, 622868, 18061054, 264895640, 7886117822, 128411926952, 3611823644006, 56348098488396, 1548284436152798, 24535910156176100, 650456890341276338, 10364916108987670024, 267426031403733462626
OFFSET
1,4
COMMENTS
The number of (directed) knight's tours is twice this. - Colin Rose, Jun 12 2006
REFERENCES
Jellis: http://home.freeuk.net/ktn/5a.htm [broken link ?]
LINKS
Hochschule Mittweida, Graph Editor
Eric Weisstein's World of Mathematics, Hamiltonian Path
Eric Weisstein's World of Mathematics, Knight Graph
EXAMPLE
There are 864 knight's tours on a 5 X 5 chessboard.
CROSSREFS
Sequence in context: A316929 A317700 A173356 * A356536 A282159 A263812
KEYWORD
nonn
AUTHOR
André Pönitz (poenitz(AT)htwm.de), Jun 11 2003
STATUS
approved