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.

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.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Dec 20 2010

Keywords

Examples

			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

Formula

See A065775.