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!)
A323714 Squares where knight moving to a lowest unvisited square on a spirally numbered board will have no available moves. 8

%I #14 Sep 26 2019 11:03:13

%S 2084,2720,3325,3753,7776,5632,7411,8562,14076,8469,9231,22702,14661,

%T 21710,21078,25809,27112,24708,19844,26943,26737,32449,31366,45036,

%U 37853,37188,43318,62095,67401,68736

%N Squares where knight moving to a lowest unvisited square on a spirally numbered board will have no available moves.

%C First term is the last term of A316667. Next terms are given by repeatedly blocking the squares where the knight would not have any available moves.

%C Plotting the terms on XY-plane seems to show a clear pattern where most of the points only land on certain directions from the center.

%C Inspired by A316667 and comments on N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019).

%H Sami Mäki, <a href="/A323714/b323714.txt">Table of n, a(n) for n = 1..4000</a>

%H N. J. A. Sloane and Brady Haran, <a href="https://www.youtube.com/watch?v=RGQe8waGJ4w">The Trapped Knight</a>, Numberphile video (2019).

%Y Cf. A316667, A323808.

%K nonn,look

%O 1,1

%A _Sami Mäki_, Jan 25 2019

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 July 17 10:03 EDT 2024. Contains 374375 sequences. (Running on oeis4.)