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

Terms

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