cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A317915 Squares visited by a (2,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=0.

This page as a plain text file.
%I A317915 #8 Feb 06 2025 04:14:52
%S A317915 0,83,30,17,26,43,14,47,40,11,36,21,32,25,18,29,46,15,42,9,38,31,22,
%T A317915 35,28,19,48,13,44,37,10,41,34,23,68,97,186,87,60,103,192,93,52,117,
%U A317915 172,285,162,81,176,133,248,143,202,109,344,215,70,1,66,59,6,49,12,39
%N A317915 Squares visited by a (2,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=0.
%C A317915 Board is numbered with the square spiral:
%C A317915   16--15--14--13--12
%C A317915    |               |
%C A317915   17   4---3---2  11   .
%C A317915    |   |       |   |
%C A317915   18   5   0---1  10   .
%C A317915    |   |           |
%C A317915   19   6---7---8---9   .
%C A317915    |
%C A317915   20--21--22--23--24--25
%C A317915 The sequence is finite: at step 7573, square 6759 is visited, after which there are no unvisited squares within one move.
%H A317915 Daniël Karssen, <a href="/A317915/b317915.txt">Table of n, a(n) for n = 0..7573</a>
%H A317915 Daniël Karssen, <a href="/A317915/a317915.svg">Figure showing the first 35 steps of the sequence</a>
%H A317915 Daniël Karssen, <a href="/A317915/a317915_1.svg">Figure showing the complete sequence</a>
%F A317915 a(n) = A317916(n+1) - 1.
%Y A317915 Cf. A317916, A317917.
%K A317915 nonn,fini,full
%O A317915 0,2
%A A317915 _Daniël Karssen_, Aug 11 2018