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.

A183051 Array of least knight's moves to points on the square |i|+|j|=n on infinite chessboard.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Dec 22 2010

Keywords

Examples

			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

Formula

See A065775.