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).
A120399
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).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =2a(4) =8a(5) =4a(6) =6a(7) =108a(8) =40a(9) =20a(10) =858a(11) =252a(12) =70a(13) =5596a(14) =1344a(15) =252a(16) =32814a(17) =6600a(18) =924a(19) =179696a(20) =30888a(21) =3432a(22) =937794a(23) =140140a(24) =12870a(25) =4721964a(26) =622336a(27) =48620a(28) =23127208a(29) =2720952
External references
- oeis: A120399