5984393805

Appears in sequences

• a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.at n=27A242512
• a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.at n=39A242514