login
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.
2
2084, 4698, 1164, 6500, 1202, 1383, 1952, 6338, 1869, 3743, 5280, 3626, 4522, 14191, 8313, 23750, 10852, 5967, 6601, 16191, 24571, 33535, 20978, 21552, 10661, 36193, 51587, 69754, 17618, 33186, 36548, 33424, 19389, 19670, 21097, 50306, 25040, 51385, 50256
OFFSET
1,1
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
PROG
(C++) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 30 2021
EXTENSIONS
More terms from Rémy Sigrist, Apr 30 2021
STATUS
approved