2089064516

Appears in sequences

• a(n) = number of knight's move paths of minimal length n steps, from origin (0,0) at center of an infinite open chessboard to square (0,0) for n=0; square (2,-1) for n=1; and square (2n-3, (n+1)mod 2) for n>=2.at n=23A242511
• a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.at n=23A242513