|
%I #14 Aug 18 2019 04:30:50
%S 1,3,11,9,23,7,19,5,15,33,13,29,53,27,25,47,77,45,21,41,69,39,17,35,
%T 61,95,59,31,55,87,127,85,51,49,79,117,163,115,75,43,71,107,151,105,
%U 67,37,63,97,139,189,137,93,57,89,129,177,233,175,125,83,81,119
%N Squares visited by moving diagonally one square on a spirally numbered board and moving to the lowest available unvisited square at each step.
%C Board is numbered with the square spiral:
%C .
%C 17--16--15--14--13
%C | |
%C 18 5---4---3 12 .
%C | | | |
%C 19 6 1---2 11 .
%C | | |
%C 20 7---8---9--10 .
%C |
%C 21--22--23--24--25--26
%H Daniël Karssen, <a href="/A316884/b316884.txt">Table of n, a(n) for n = 1..10000</a>
%H Daniël Karssen, <a href="/A316884/a316884.svg">Figure showing the first 49 steps of the sequence</a>
%Y Cf. A316667, A316671.
%K nonn
%O 1,2
%A _Daniël Karssen_, Jul 15 2018
|
