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 A306197 #10 Sep 26 2019 11:03:13 %S A306197 3199,9173,7416,16270,12669,4238,36667,10947,4851,15027,34407,36777, %T A306197 28411,29623,5832,237635,17075,14329,17064,8669,9152,191876,65307, %U A306197 10536,50425,7243,17187,9730,307545,45627,82813,16948,24847,66622,23741,24678,259181,147061,48250,43525,78711,19501,18600,59821,15410,334131 %N A306197 The label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1. Each move is to the lowest-numbered unvisited square. %C A306197 The entries are the lower triangle of an array, for (m,n)-leaper, where 1 <= n < m, ordered: (2,1), (3,1), (3,2), (4,1), (4,2), etc. Are all terms finite? %H A306197 N. J. A. Sloane and Brady Haran, <a href="https://www.youtube.com/watch?v=RGQe8waGJ4w">The Trapped Knight</a>, Numberphile video (2019). %e A306197 A chess knight (a (2,1)-leaper) reaches the square labeled 3199 before it reaches the square labeled 2084 and has no moves available (see A316667). %Y A306197 Cf. A316667, A323749, A323750, A317106, A317471, A317416, A323750, A317438, A317916. %K A306197 nonn,tabf %O A306197 1,1 %A A306197 _Jud McCranie_, Jan 28 2019