Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Apr 30 2021 21:22:26
%S 2016,4634,1888,4286,1796,3487,3984,7796,5679,5961,7560,7748,9646,
%T 17577,13023,23988,19620,14361,20975,25731,40503,31217,39468,44026,
%U 31047,75831,62593,70020,69960,65902,79304,64266,66381,62110,72787,122490,139654,117203
%N 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 As in all these sequences (cf. A316667), the knight or leaper must always move to the lowest-numbered unvisited square.
%D Andrew Trevorrow, Posting to Math Fun Mailing List, Apr 29 2021.
%H Rémy Sigrist, <a href="/A343178/b343178.txt">Table of n, a(n) for n = 1..1000</a>
%H Rémy Sigrist, <a href="/A343178/a343178.png">Colored representation of the squares visited for n = 1000</a>
%H Rémy Sigrist, <a href="/A343178/a343178.txt">C++ program for A343178</a>
%o (C++) See Links section.
%Y Cf. A316667, A323469, A323471, A343179.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Apr 30 2021
%E More terms from _Rémy Sigrist_, Apr 30 2021