Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).
A065775
Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).
Terms
- a(0) =0a(1) =3a(2) =3a(3) =2a(4) =2a(5) =2a(6) =3a(7) =1a(8) =1a(9) =3a(10) =2a(11) =2a(12) =4a(13) =2a(14) =2a(15) =3a(16) =3a(17) =3a(18) =3a(19) =3a(20) =3a(21) =4a(22) =4a(23) =2a(24) =2a(25) =2a(26) =4a(27) =4a(28) =5a(29) =3
External references
- oeis: A065775