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.

A317416 Squares visited by a (1,4)-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 A317416 #11 Feb 06 2025 04:10:22
%S A317416 1,52,23,14,25,20,11,18,13,24,15,22,17,12,19,10,21,16,29,6,27,32,9,34,
%T A317416 7,26,45,4,47,42,67,108,149,36,41,2,39,44,5,28,57,86,3,38,33,8,35,30,
%U A317416 51,46,71,104,143,96,65,40,63,94,131,176,123,48,75,118,161,156,107,66
%N A317416 Squares visited by a (1,4)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=1.
%C A317416 Board is numbered with the square spiral:
%C A317416 .
%C A317416   17--16--15--14--13
%C A317416    |               |
%C A317416   18   5---4---3  12   .
%C A317416    |   |       |   |
%C A317416   19   6   1---2  11   .
%C A317416    |   |           |
%C A317416   20   7---8---9--10   .
%C A317416    |
%C A317416   21--22--23--24--25--26
%C A317416 .
%C A317416 The sequence is finite: at step 13103, square 10847 is visited, after which there are no unvisited squares within one move.
%H A317416 Daniël Karssen, <a href="/A317416/b317416.txt">Table of n, a(n) for n = 1..13103</a>
%H A317416 Daniël Karssen, <a href="/A317416/a317416.svg">Figure showing the first 58 steps of the sequence</a>
%H A317416 Daniël Karssen, <a href="/A317416/a317416_1.svg">Figure showing the complete sequence</a>
%F A317416 a(n) = A317415(n-1) + 1.
%Y A317416 Cf. A317415, A317418.
%K A317416 nonn,fini,full
%O A317416 1,2
%A A317416 _Daniël Karssen_, Jul 27 2018