This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183049 Array of least knight's moves to points (n,0), (n-1,1), ..., (1,n-1) on infinite chessboard. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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. LINKS FORMULA See A065775. EXAMPLE 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 Cf. A065775, A183050, A183051. Sequence in context: A133882 A092106 A278885 * A178086 A281977 A240666 Adjacent sequences:  A183046 A183047 A183048 * A183050 A183051 A183052 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 03:27 EST 2018. Contains 318052 sequences. (Running on oeis4.)