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!)
 A068613 Path of a knight's tour on an infinite chessboard. 11

%I #18 May 10 2019 17:07:32

%S 1,24,7,18,15,12,9,22,19,16,3,10,23,20,5,14,11,8,21,6,17,4,13,2,25,80,

%T 47,76,43,70,39,66,63,34,59,56,29,52,49,78,45,74,71,40,67,64,35,60,31,

%U 54,27,50,79,46,75,72,41,68,37,62

%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="/A068613/b068613.txt">Table of n, a(n) for n = 0..1088</a>

%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, A068611, A068612, A068614, A068615.

%K nonn,look

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 09:02 EST 2023. Contains 367600 sequences. (Running on oeis4.)