login

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”).

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.
2
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,2
FORMULA
See A065775.
EXAMPLE
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
CROSSREFS
Sequence in context: A286013 A208083 A181515 * A060847 A079528 A143422
KEYWORD
nonn,tabf
AUTHOR
Clark Kimberling, Dec 20 2010
STATUS
approved