cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A183049 Array of least knight's moves to points (n,0), (n-1,1), ..., (1,n-1) on infinite chessboard.

Original entry on oeis.org

0, 3, 2, 2, 3, 1, 1, 2, 2, 4, 2, 3, 3, 3, 3, 3, 4, 4, 2, 2, 2, 4, 5, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 3, 3, 3, 3, 5, 5, 6, 6, 4, 4, 4, 4, 4, 4, 4, 6, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 4, 4, 4, 4, 4, 6, 6, 6, 7, 7, 7, 5, 5, 5, 5, 5
Offset: 1

Views

Author

Clark Kimberling, Dec 22 2010

Keywords

Comments

The n points (n,0), (n-1,1), ..., (1,n-1) lie in a diagonal in the first quadrant. Adjoining the matching points in the other quadrants yields the square |i|+|j|=n, as in A183051. For a description of the infinite chessboard, see A065775.

Examples

			First 6 rows (after the initial 0):
3
2 2
3 1 1
2 2 4 2
3 3 3 3 3
4 4 2 2 2 4
These numbers occupy positions on the chessboard as
indicated here, starting at the left bottom corner:
..4
..3 4
..2 3 2
..1 4 3 2
..2 1 2 3 4
0 3 2 3 2 3 4 ... (This row is A018837.)
		

Crossrefs

Formula

See A065775.