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,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

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

Example

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

Crossrefs

Cf. A079137, A118067.

Sequence in context: A316929 A317700 A173356 * A356536 A282159 A263812

Adjacent sequences: A083383 A083384 A083385 * A083387 A083388 A083389

Keyword

nonn

Author

André Pönitz, Jun 11 2003

Status

approved