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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068611 Path of a knight's tour on an infinite chessboard. 9
 1, 22, 9, 12, 15, 18, 7, 24, 11, 14, 5, 20, 23, 10, 3, 16, 19, 8, 25, 2, 13, 4, 17, 6, 21, 74, 45, 78, 49, 52, 29, 56, 59, 34, 63, 66, 39, 70, 43, 76, 47, 80, 51, 28, 55, 58, 33, 62, 37, 68, 41, 72, 75, 46, 79, 50, 27, 54, 31, 60 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS One of eight possible knight's tours. Squares are numbered in a clockwise spiral. Enumerates all positive integers. LINKS Hugo Pfoertner, Table of n, a(n) for n = 0..1088 [Offset adapted by Georg Fischer, Jun 04 2019] Frank Ellermann, Sequences based on a spiral of the natural numbers CROSSREFS Cf. A068608, A068609, A068610, A068612, A068613, A068614, A068615. Sequence in context: A298781 A058402 A248032 * A104061 A196103 A196100 Adjacent sequences: A068608 A068609 A068610 * A068612 A068613 A068614 KEYWORD nonn AUTHOR Hans Secelle and Albrecht Heeffer (albrecht.heeffer(AT)pandora.be), Mar 09 2002 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.

Last modified December 11 10:53 EST 2023. Contains 367722 sequences. (Running on oeis4.)