%I A079312
%S A079312 0,0,32,0,328,2976,25512,124352,758752,4852448,26735408,145945312,805129880,
%T A079312 4334341216,22824469832,119276925152,617722010896,3163151197504,16059782780784,
%U A079312 80965219241952,405344545960912
%N 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.
%C A079312 See A079137, which is the main entry for this problem.
%C A079312 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.
%e A079312 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.
%Y A079312 Equals 4*A079137(n). Cf. A070030.
%Y A079312 Sequence in context: A091308 A023927 A057376 this_sequence A062543 A086820 
               A014777
%Y A079312 Adjacent sequences: A079309 A079310 A079311 this_sequence A079313 A079314 
               A079315
%K A079312 nonn
%O A079312 1,3
%A A079312 Alex Healy (ahealy(AT)fas.harvard.edu), Feb 11 2003