A183045 Triangular array, T(i,j)=number of knight's moves to points on vertical segments (n,-n), (n,-n+1), ... (n,n) on infinite chessboard.
0, 2, 3, 2, 4, 1, 2, 1, 4, 2, 3, 2, 3, 2, 3, 2, 4, 3, 2, 3, 2, 3, 2, 3, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 5, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 4, 6, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 6, 6, 5, 6, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 6, 5, 6, 6, 7, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5
Offset: 1
Examples
First five rows: 0 2 3 2 4 1 2 1 4 2 3 2 3 2 3 2 4 3 2 3 2 3 2 3 4
Formula
See A065775.