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

A183051
Array of least knight's moves to points on the square |i|+|j|=n on infinite chessboard.
4
0, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 4, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 2, 2, 2, 4, 4, 4, 2, 2, 2, 4, 4, 4, 2, 2, 2, 4, 4, 4, 2, 2, 2, 4, 5, 3, 3, 3, 3, 3, 3
OFFSET
1,2
FORMULA
See A065775.
EXAMPLE
Top 5 rows:
0
3 3 3 3
2 2 2 2 2 2 2 2
3 1 1 3 1 1 3 1 1 3 1 1
2 2 4 2 2 2 4 2 2 2 4 2 2 2 4 2
Row n has 4n numbers which form a square of points (i.e., unit squares) on an infinite chessboard. The first 3 of these concentric squares are represented as follows:
....2
..2.3.2
2.3.0.3.2
..2.3.2
....2
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Clark Kimberling, Dec 22 2010
STATUS
approved