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

0, 0, 0, 82, 864, 18784, 622868, 18061054, 264895640, 7886117822, 128411926952, 3611823644006, 56348098488396, 1548284436152798, 24535910156176100, 650456890341276338, 10364916108987670024, 267426031403733462626

Offset: 1

Author

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

Keywords

• nonn

Comments

The number of (directed) knight's tours is twice this. - Colin Rose, Jun 12 2006

Examples

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

References

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

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..50
• Hochschule Mittweida, Graph Editor
• C. Rose, The Distribution of the Knight
• Eric Weisstein's World of Mathematics, Hamiltonian Path
• Eric Weisstein's World of Mathematics, Knight Graph

Crossrefs

Cf. A079137, A118067.