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 A343179 #30 May 01 2021 02:14:22 %S A343179 2084,4698,1164,6500,1202,1383,1952,6338,1869,3743,5280,3626,4522, %T A343179 14191,8313,23750,10852,5967,6601,16191,24571,33535,20978,21552,10661, %U A343179 36193,51587,69754,17618,33186,36548,33424,19389,19670,21097,50306,25040,51385,50256 %N A343179 On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that an (n,n+1) leaper reaches before getting trapped, or -1 if it never gets trapped. %C A343179 As in all these sequences (cf. A316667), the knight or leaper must always move to the lowest-numbered unvisited square. %D A343179 Andrew Trevorrow, Posting to Math Fun Mailing List, Apr 29 2021. %H A343179 Rémy Sigrist, <a href="/A343179/b343179.txt">Table of n, a(n) for n = 1..1000</a> %H A343179 Rémy Sigrist, <a href="/A343179/a343179.txt">C++ program for A343179</a> %o A343179 (C++) See Links section. %Y A343179 Cf. A316667, A323469, A323471, A323750, A343178. %K A343179 nonn %O A343179 1,1 %A A343179 _N. J. A. Sloane_, Apr 30 2021 %E A343179 More terms from _Rémy Sigrist_, Apr 30 2021