login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309918 The number of steps for a knight to be trapped when moving on a spirally numbered 2D grid and starting at square n. 4
2016, 880, 2741, 857, 2741, 857, 2741, 3611, 2590, 1540, 1846, 2061, 4892, 1047, 4139, 753, 3559, 590, 426, 1205, 1140, 2759, 3830, 4687, 1839, 2101, 2861, 5892, 5500, 1295, 2674, 1213, 890, 1839, 2749, 6531, 1118, 3632, 1496, 2888, 1995, 2574, 2713, 495, 1479, 5509, 1414, 3926, 1078 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

For a knight moving on a spirally numbered 2D grid to the lowest available unvisited square, see A316667, a(n) gives the number of steps before the knight is trapped when the knight starts on the square numbered n.

For n up to 1200000 the smallest number of steps before being trapped is for the starting square 76 where it is trapped at step 263, the final square being 150. As the maximum relative x or y coordinate offset from the central 1 square is more than 526 ( 2 * 263 ) for starting values near 1100000, and as no smaller path to being trapped was found, this implies 263 is the smallest possible path to being trapped for all possible starting squares.

The largest number of steps before being trapped for n up to 1200000 is for starting square 11509 where it is trapped at step 21346, the final square being 23134. See A306291 for an image of the path. This is a surprisingly small numbered starting square considering the longest path to being trapped for starting squares 20000 to 1200000 is 14280. Note however that the maximum number of steps is not bounded since it will increase to arbitrarily large values as the knight starts farther and farther away from the central 1 square.

LINKS

Scott R. Shannon, Table of n, a(n) for n = 1..10000.

Scott R. Shannon, Path for starting square 76. The start square 76 is marked with a green dot, the final square 150 with a red dot, and the eight surrounding blocking squares with blue dots.

Scott R. Shannon, Map of starting square to trapped steps count for n = 1 to 100000. The colors are graded from red to violet indicating the relative size of the number of steps to being trapped for the corresponding start square. The pattern is surprisingly similar to the starting square to loop mapping image shown in A306308.

N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019).

EXAMPLE

The knight starting on square 1 becomes trapped at step 2016, see A316667.

CROSSREFS

Cf. A306291, A306308, A316667.

Sequence in context: A250836 A076666 A323470 * A189188 A076582 A323749

Adjacent sequences:  A309915 A309916 A309917 * A309919 A309920 A309921

KEYWORD

nonn,look

AUTHOR

Scott R. Shannon, Aug 23 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 06:43 EDT 2022. Contains 353693 sequences. (Running on oeis4.)