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.
%I A316588 #27 Sep 26 2019 11:03:13 %S A316588 1,8,6,2,12,9,4,3,13,7,5,10,26,18,11,30,24,16,38,31,22,17,25,20,28,34, %T A316588 14,21,43,33,27,19,15,35,42,32,23,29,39,47,56,69,37,48,40,51,60,70,57, %U A316588 67,81,46,58,49,41,52,44,55,64,36,65,53,45,76,63,54,66 %N A316588 Squares visited by knight moves on a diagonally numbered board and moving to the lowest available unvisited square at each step. %C A316588 Board is numbered as follows: %C A316588 1 2 4 7 11 16 . %C A316588 3 5 8 12 17 . %C A316588 6 9 13 18 . %C A316588 10 14 19 . %C A316588 15 20 . %C A316588 21 . %C A316588 . %C A316588 This sequence is finite: At step 2402, square 1378 is visited, after which there are no unvisited squares within one knight move. %H A316588 Daniël Karssen, <a href="/A316588/b316588.txt">Table of n, a(n) for n = 1..2402</a> %H A316588 Daniël Karssen, <a href="/A316588/a316588.svg">Figure showing the complete sequence</a> %H A316588 Daniël Karssen, <a href="/A316588/a316588.m.txt">MATLAB script to generate the complete sequence</a> %H A316588 N. J. A. Sloane and Brady Haran, <a href="https://www.youtube.com/watch?v=RGQe8waGJ4w">The Trapped Knight</a>, Numberphile video (January, 2019) %H A316588 Author?, <a href="https://www.youtube.com/watch?v=411keYx3KxY">Adjusting the trapped knight</a>, Youtube video, Feb 11 2019 %Y A316588 Cf. A316328, A316667, A316334, A316335. %K A316588 nonn,fini,full,look %O A316588 1,2 %A A316588 _Daniël Karssen_, Jul 07 2018