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.

A317916 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 >=1.

This page as a plain text file.
%I A317916 #7 Feb 06 2025 04:14:32
%S A317916 1,84,31,18,27,44,15,48,41,12,37,22,33,26,19,30,47,16,43,10,39,32,23,
%T A317916 36,29,20,49,14,45,38,11,42,35,24,69,98,187,88,61,104,193,94,53,118,
%U A317916 173,286,163,82,177,134,249,144,203,110,345,216,71,2,67,60,7,50,13,40
%N A317916 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 >=1.
%C A317916 Board is numbered with the square spiral:
%C A317916   17--16--15--14--13
%C A317916    |               |
%C A317916   18   5---4---3  12   .
%C A317916    |   |       |   |
%C A317916   19   6   1---2  11   .
%C A317916    |   |           |
%C A317916   20   7---8---9--10   .
%C A317916    |
%C A317916   21--22--23--24--25--26
%C A317916 The sequence is finite: at step 7574, square 6760 is visited, after which there are no unvisited squares within one move.
%H A317916 Daniël Karssen, <a href="/A317916/b317916.txt">Table of n, a(n) for n = 1..7574</a>
%H A317916 Daniël Karssen, <a href="/A317916/a317916.svg">Figure showing the first 35 steps of the sequence</a>
%H A317916 Daniël Karssen, <a href="/A317916/a317916_1.svg">Figure showing the complete sequence</a>
%F A317916 a(n) = A317915(n-1) + 1.
%Y A317916 Cf. A317915, A317918.
%K A317916 nonn,fini,full
%O A317916 1,2
%A A317916 _Daniël Karssen_, Aug 11 2018