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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A317466 Squares visited by a (2,2)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step. 3

%I #8 Jul 31 2018 10:05:54

%S 0,12,52,24,76,20,68,16,60,136,56,128,232,124,80,164,280,160,72,152,

%T 264,148,64,140,248,388,244,132,236,372,540,368,228,168,284,432,612,

%U 428,276,156,268,412,588,408,260,144,252,392,564,768,560,384,240,376

%N Squares visited by a (2,2)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step.

%C Board is numbered with the square spiral:

%C .

%C 16--15--14--13--12

%C | |

%C 17 4---3---2 11 .

%C | | | |

%C 18 5 0---1 10 .

%C | | |

%C 19 6---7---8---9 .

%C |

%C 20--21--22--23--24--25

%H Daniël Karssen, <a href="/A317466/b317466.txt">Table of n, a(n) for n = 0..9999</a>

%H Daniël Karssen, <a href="/A317466/a317466.svg">Figure showing the first 11 steps of the sequence</a>

%H Daniël Karssen, <a href="/A317466/a317466_1.svg">Figure showing the first 9999 steps of the sequence</a>

%F a(n) = A317467(n+1) - 1.

%Y Cf. A317467, A317468.

%K nonn

%O 0,2

%A _Daniël Karssen_, Jul 29 2018

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 September 24 00:05 EDT 2023. Contains 365554 sequences. (Running on oeis4.)