

A165134


Number of knight's paths visiting each square of a chessboard exactly once.


1




OFFSET

1,5


REFERENCES

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


LINKS

Table of n, a(n) for n=1..7.
Stefan Behnel, The Knight's Paths
A. Chernov, Open knight's tours
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


STATUS

approved



