login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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
Sequence in context: A138070 A081334 A106694 * A031355 A337265 A177228
KEYWORD
nonn,tabf
AUTHOR
Clark Kimberling, Dec 22 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 08:46 EDT 2024. Contains 373543 sequences. (Running on oeis4.)