login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323469 On a spirally numbered chessboard, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped. 7
-1, 2016, 3723, 13103, 14570, 26967, 101250, 158735, 132688, 220439, 144841, 646728, 350720, 66183, 75259, 248764, 118694, 307483, 238208, 189159, 139639, 183821, 151016, 171076, 114187, 262235, 178612, 257632, 124475, 178862, 143674, 196795, 60707, 309820 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A (1,2) leaper is a chess knight.

a(2)-a(5) were computed by Daniël Karssen.

LINKS

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

Neil Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019)

CROSSREFS

The sequences involved in this set of related sequences are A316884, A316967, A316667, A316328, A317106, A317105, A317416, A317415, A317438, A317437, and A323469, A323470, A323471, A323472.

Sequence in context: A189188 A076582 A323749 * A125491 A166818 A166800

Adjacent sequences:  A323466 A323467 A323468 * A323470 A323471 A323472

KEYWORD

sign

AUTHOR

N. J. A. Sloane, Jan 28 2019

EXTENSIONS

More terms from Rémy Sigrist, Jan 29 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 20:23 EDT 2019. Contains 323528 sequences. (Running on oeis4.)