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.

2016, 4634, 1888, 4286, 1796, 3487, 3984, 7796, 5679, 5961, 7560, 7748, 9646, 17577, 13023, 23988, 19620, 14361, 20975, 25731, 40503, 31217, 39468, 44026, 31047, 75831, 62593, 70020, 69960, 65902, 79304, 64266, 66381, 62110, 72787, 122490, 139654, 117203

Offset: 1

Author

N. J. A. Sloane, Apr 30 2021

Keywords

• nonn

Comments

As in all these sequences (cf. A316667), the knight or leaper must always move to the lowest-numbered unvisited square.

References

• Andrew Trevorrow, Posting to Math Fun Mailing List, Apr 29 2021.

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..1000
• Rémy Sigrist, Colored representation of the squares visited for n = 1000
• Rémy Sigrist, C++ program for A343178

Crossrefs

Cf. A316667, A323469, A323471, A343179.

Extensions

More terms from Rémy Sigrist, Apr 30 2021