622336

Appears in sequences

• Consider n x n chessboard. This sequence gives number of chess knight paths from left bottom corner of the board to the right top corner with minimal possible path length (shortest paths).at n=26A120399
• a(n) = (6*n)!/((3*n)!*(2*n)!) * (n/2)!/(3*n/2)!.at n=3A347854