This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118067 Number of knight's tours on a 3 X k chessboard. 2


%S 0,0,0,16,0,0,104,792,1120,6096,21344,114496,257728,1292544,3677568,

%T 17273760,46801984,211731376,611507360,2645699504,7725948608

%N Number of knight's tours on a 3 X k chessboard.

%C 1. Jelliss computes the number of tour diagrams (which is equal to half the number of tours). 2. Sequence A079137 computes the number of tour DIAGRAMS for a 4 X k board (again, equal to half the number of tours). 3. Kraitchik (1942) incorrectly reports 376 tour diagrams for the 3 X 8 case; the correct number is 396 (i.e., 792 tours) [cf. Rose, Jelliss].

%D Kraitchik, M., Mathematical Recreations. New York: W. W. Norton, pp. 264-5, 1942.

%H G. Jelliss, <a href="http://www.mayhematics.com/t/oa.htm">Open Knight's Tours of Three-Rank Boards</a>

%H Seiichi Manyama calculated a(14)-a(21) by <a href="http://ja.stackoverflow.com/questions/16525/m%C3%97n-board">yoh2's code</a>

%H C. Rose, <a href="http://www.tri.org.au/knightframe.html">The Distribution of the Knight</a>.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KnightsTour.html">Knight's Tours</a> - from MathWorld

%t Mathematica notebook available at: http://www.tri.org.au/knightframe.html

%Y Cf. A079137.

%Y Cf. A158074. - _Eric W. Weisstein_, Mar 13 2009

%K nonn,more

%O 1,4

%A _Colin Rose_, May 11 2006

%E a(13) from _Eric W. Weisstein_, Mar 13 2009

%E a(14)-a(21) from _Seiichi Manyama_, Apr 25 2016

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 June 23 13:28 EDT 2017. Contains 288665 sequences.