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 A343178 #23 Apr 30 2021 21:22:26 %S A343178 2016,4634,1888,4286,1796,3487,3984,7796,5679,5961,7560,7748,9646, %T A343178 17577,13023,23988,19620,14361,20975,25731,40503,31217,39468,44026, %U A343178 31047,75831,62593,70020,69960,65902,79304,64266,66381,62110,72787,122490,139654,117203 %N A343178 On a spirally numbered square grid, with labels starting at 1, this is the number of steps that an (n,n+1) leaper makes before getting trapped, or -1 if it never gets trapped. %C A343178 As in all these sequences (cf. A316667), the knight or leaper must always move to the lowest-numbered unvisited square. %D A343178 Andrew Trevorrow, Posting to Math Fun Mailing List, Apr 29 2021. %H A343178 Rémy Sigrist, <a href="/A343178/b343178.txt">Table of n, a(n) for n = 1..1000</a> %H A343178 Rémy Sigrist, <a href="/A343178/a343178.png">Colored representation of the squares visited for n = 1000</a> %H A343178 Rémy Sigrist, <a href="/A343178/a343178.txt">C++ program for A343178</a> %o A343178 (C++) See Links section. %Y A343178 Cf. A316667, A323469, A323471, A343179. %K A343178 nonn %O A343178 1,1 %A A343178 _N. J. A. Sloane_, Apr 30 2021 %E A343178 More terms from _Rémy Sigrist_, Apr 30 2021