Number of steps for {2,3} fairy knight to reach (n,0) on infinite chessboard.

Terms

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