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.

A317438 Squares visited by a (1,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 A317438 #11 Feb 06 2025 04:08:55
%S A317438 1,85,23,33,25,31,17,29,19,27,21,35,55,5,53,7,51,45,15,47,13,37,59,9,
%T A317438 61,89,125,179,231,49,75,39,11,41,63,93,141,187,239,177,123,87,81,115,
%U A317438 155,105,73,117,159,107,65,95,131,175,169,219,277,43,67,3,69,99,137
%N A317438 Squares visited by a (1,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=1.
%C A317438 Board is numbered with the square spiral:
%C A317438 .
%C A317438   17--16--15--14--13
%C A317438    |               |
%C A317438   18   5---4---3  12   .
%C A317438    |   |       |   |
%C A317438   19   6   1---2  11   .
%C A317438    |   |           |
%C A317438   20   7---8---9--10   .
%C A317438    |
%C A317438   21--22--23--24--25--26
%C A317438 .
%C A317438 The sequence is finite: at step 14570, square 25963 is visited, after which there are no unvisited squares within one move.
%H A317438 Daniël Karssen, <a href="/A317438/b317438.txt">Table of n, a(n) for n = 1..14570</a>
%H A317438 Daniël Karssen, <a href="/A317438/a317438.svg">Figure showing the first 26 steps of the sequence</a>
%H A317438 Daniël Karssen, <a href="/A317438/a317438_1.svg">Figure showing the complete sequence</a>
%Y A317438 Cf. A317437, A317440.
%K A317438 nonn,fini,full
%O A317438 1,2
%A A317438 _Daniël Karssen_, Jul 28 2018