Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Jan 09 2024 16:35:21
%S 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,
%T 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,
%U 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
%N 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.
%F See A065775.
%e First five rows:
%e 0
%e 2 3 2
%e 4 1 2 1 4
%e 2 3 2 3 2 3 2
%e 4 3 2 3 2 3 2 3 4
%Y Cf. A065775, A183043.
%K nonn,tabf
%O 1,2
%A _Clark Kimberling_, Dec 20 2010