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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323470 On a spirally numbered square grid, with labels starting at 0, this is the number of the final step that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped. 7
 -1, 2015, 3722, 13102, 14569, 26966, 101249, 158734, 132687, 220438, 144840, 646727, 350719, 66182, 75258, 248763, 118693, 307482, 238207, 189158, 139638, 183820, 151015, 171075, 114186, 262234, 178611, 257631, 124474, 178861, 143673, 196794, 60706, 309819 (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 Rémy Sigrist, C++ program for A323470 N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019) PROG (C++) See Links section. 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: A191421 A250836 A076666 * A309918 A189188 A076582 Adjacent sequences:  A323467 A323468 A323469 * A323471 A323472 A323473 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 03:13 EDT 2022. Contains 354093 sequences. (Running on oeis4.)