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 A323763 #23 Feb 04 2019 08:36:03 %S A323763 1,10,3,6,9,4,7,2,5,8,11,14,18,15,12,16,19,22,41,17,33,30,34,13,27,23, %T A323763 20,24,44,40,21,39,36,60,31,53,26,46,25,28,32,29,51,47,75,42,45,71,74, %U A323763 70,38,35,59,56,86,50,78,49,52,80,83,79,115,73,107,67,64 %N A323763 Squares visited by gnu (A.K.A. wildebeest; (1,2)+(1,3)-leaper chess piece) moves on a spirally numbered board and moving to the lowest available unvisited square at each step. %C A323763 In fairy chess the (1,2)+(1,3)-leaper is called a Gnu. - _Vaclav Kotesovec_, Jan 28 2019 %C A323763 Board is numbered with the square spiral: %C A323763 . %C A323763 17--16--15--14--13 %C A323763 | | %C A323763 18 5---4---3 12 . %C A323763 | | | | %C A323763 19 6 1---2 11 . %C A323763 | | | %C A323763 20 7---8---9--10 . %C A323763 | %C A323763 21--22--23--24--25--26 %C A323763 . %C A323763 This sequence is finite: At step 12899744968 square 12851850258 is visited, after which there are no unvisited squares within one move. %H A323763 Wikipedia, <a href="https://en.wikipedia.org/wiki/Fairy_chess_piece">Fairy chess piece</a> %H A323763 Wikipedia, <a href="https://en.wikipedia.org/wiki/Wildebeest_Chess">Wildebeest Chess</a> %Y A323763 Cf. A316667, A317106. %K A323763 nonn,fini %O A323763 1,2 %A A323763 _Jonathan Allan_, Jan 26 2019