a(n) is the least number of knight's moves from corner (0,0) to n-th diagonal of unbounded chessboard.

A047878

a(n) is the least number of knight's moves from corner (0,0) to n-th diagonal of unbounded chessboard.

Terms

    a(0) =0a(1) =3a(2) =2a(3) =1a(4) =2a(5) =3a(6) =2a(7) =3a(8) =4a(9) =3a(10) =4a(11) =5a(12) =4a(13) =5a(14) =6a(15) =5a(16) =6a(17) =7a(18) =6a(19) =7a(20) =8a(21) =7a(22) =8a(23) =9a(24) =8a(25) =9a(26) =10a(27) =9a(28) =10a(29) =11

External references