|
|
A165134
|
|
Number of directed Hamiltonian paths in the n X n knight graph.
|
|
7
|
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Previous name was: Number of knight's paths visiting each square of an n X n chessboard exactly once.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=5 the numbers in the table below give the number of knight's paths starting at the respective position on the 5 X 5 chessboard. In total there are a(5) = 304*4 + 56*8 + 64 = 1728 solutions.
[1] [2] [3] [4] [5]
[1] 304 0 56 0 304
[2] 0 56 0 56 0
[3] 56 0 64 0 56
[4] 0 56 0 56 0
[5] 304 0 56 0 304
(End)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
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
|
|
STATUS
|
approved
|
|
|
|