cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Apr 30 2021

Keywords

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

Crossrefs

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

Extensions

More terms from Rémy Sigrist, Apr 30 2021
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.