The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068611 Path of a knight's tour on an infinite chessboard. 9


%S 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,

%T 45,78,49,52,29,56,59,34,63,66,39,70,43,76,47,80,51,28,55,58,33,62,37,

%U 68,41,72,75,46,79,50,27,54,31,60

%N Path of a knight's tour on an infinite chessboard.

%C One of eight possible knight's tours. Squares are numbered in a clockwise spiral. Enumerates all positive integers.

%H Hugo Pfoertner, <a href="/A068611/b068611.txt">Table of n, a(n) for n = 0..1088</a> [Offset adapted by _Georg Fischer_, Jun 04 2019]

%H Frank Ellermann, <a href="http://oeis.org/A068225/a068225.html">Sequences based on a spiral of the natural numbers</a>

%Y Cf. A068608, A068609, A068610, A068612, A068613, A068614, A068615.

%K nonn

%O 0,2

%A Hans Secelle and Albrecht Heeffer (albrecht.heeffer(AT)pandora.be), Mar 09 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 15:36 EST 2021. Contains 349526 sequences. (Running on oeis4.)