|
| |
|
|
A079312
|
|
Number of open knight's tours on a 4 X n chessboard; there are no closed knight's tours on a 4 X n chessboard.
|
|
1
| |
|
|
0, 0, 32, 0, 328, 2976, 25512, 124352, 758752, 4852448, 26735408, 145945312, 805129880, 4334341216, 22824469832, 119276925152, 617722010896, 3163151197504, 16059782780784, 80965219241952, 405344545960912
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| See A079137, which is the main entry for this problem.
This sequence is known to be given by a linear recurrence relation with constant coefficients, although as far as I know this recurrence has not yet been explicitly computed.
|
|
|
EXAMPLE
| There are 2976 ways to start with a knight on some square of a 4 X 6 chessboard and make 23 moves such that each square is visited exactly once.
|
|
|
CROSSREFS
| Equals 4*A079137(n). Cf. A070030.
Sequence in context: A091308 A023927 A057376 * A062543 A086820 A174923
Adjacent sequences: A079309 A079310 A079311 * A079313 A079314 A079315
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alex Healy (ahealy(AT)post.harvard.edu), Feb 11 2003
|
| |
|
|
