%I #12 Feb 03 2022 12:59:07
%S 0,1,9,24,46,45,21,6,4,15,33,32,12,11,10,8,7,5,16,36,63,97,96,60,13,
%T 27,50,80,119,165,164,116,75,41,68,66,64,99,141,140,138,93,55,86,84,
%U 49,79,78,76,43,69,104,102,100,143,193,192,190,137,57,54,52,25
%N Lexicographically earliest Racetrack trajectory (using von Neumann neighborhood) on spiral on infinite square grid.
%C The car starts at square 0 and thereafter moves, according to the rules of Racetrack with von Neumann neighborhood (see A351042), to the lowest numbered unvisited square. The spiral numbering is described in A316328. After 146 steps, the car cannot move to any unvisited square, so the sequence is finite with 147 terms.
%H Pontus von Brömssen, <a href="/A351043/b351043.txt">Table of n, a(n) for n = 0..146</a>
%H Pontus von Brömssen, <a href="/A351043/a351043.svg">Trajectory of the Racetrack car in A351043</a>.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Racetrack_(game)">Racetrack</a>
%Y Cf. A316328, A351042.
%K nonn,fini,full
%O 0,3
%A _Pontus von Brömssen_, Jan 30 2022