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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165134 Number of knight's paths visiting each square of a chessboard exactly once. 1
1, 0, 0, 0, 1728, 6637920, 165575218320, 19591828170979904 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..8.

Stefan Behnel, The Knight's Paths

A. Chernov, Open knight's tours

P. Hingston, G. Kendall, Enumerating knight's tours using an ant colony algorithm, The 2005 IEEE Congress on Evolutionary Computation, 2 (2006), 1003-1010

G. Stertenbrink, Number of Knight's Tours

CROSSREFS

Cf. A118067, A079137, A083386, A001230.

Sequence in context: A002519 A052068 A114767 * A013797 A013864 A112140

Adjacent sequences:  A165131 A165132 A165133 * A165135 A165136 A165137

KEYWORD

nonn

AUTHOR

[No name given] (c.candide(AT)free.fr), Sep 04 2009

EXTENSIONS

a(7) from Guenter Stertenbrink, added by Alex Chernov, Sep 01 2013

a(1)=1, a(2)=0 prepended by Max Alekseyev, Sep 22 2013

a(8) from Alex Chernov, May 10 2014

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 23 18:50 EST 2014. Contains 249865 sequences.