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.

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

Rémy Sigrist, Table of n, a(n) for n = 1..1000

Rémy Sigrist, C++ program for A343179

Prog

(C++) See Links section.

Crossrefs

Cf. A316667, A323469, A323471, A323750, A343178.

Sequence in context: A323472 A224438 A323714 * A323750 A323471 A251225

Adjacent sequences: A343176 A343177 A343178 * A343180 A343181 A343182

Keyword

nonn

Author

N. J. A. Sloane, Apr 30 2021

Extensions

More terms from Rémy Sigrist, Apr 30 2021

Status

approved