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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083386 Number (undirected) Hamiltonian paths in the 5 X n knight graph. 4
0, 0, 0, 82, 864, 18784, 622868, 18061054, 264895640, 7886117822, 128411926952, 3611823644006, 56348098488396, 1548284436152798, 24535910156176100, 650456890341276338, 10364916108987670024, 267426031403733462626 (list; graph; refs; listen; history; text; internal format)
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: A128959 A230394 A173356 * A282159 A263812 A160154

Adjacent sequences:  A083383 A083384 A083385 * A083387 A083388 A083389

KEYWORD

nonn

AUTHOR

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

STATUS

approved

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 September 20 16:14 EDT 2017. Contains 292276 sequences.