[go: up one dir, main page]

login
A351043
Lexicographically earliest Racetrack trajectory (using von Neumann neighborhood) on spiral on infinite square grid.
2
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, 27, 50, 80, 119, 165, 164, 116, 75, 41, 68, 66, 64, 99, 141, 140, 138, 93, 55, 86, 84, 49, 79, 78, 76, 43, 69, 104, 102, 100, 143, 193, 192, 190, 137, 57, 54, 52, 25
OFFSET
0,3
COMMENTS
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.
LINKS
Pontus von Brömssen, Table of n, a(n) for n = 0..146
Wikipedia, Racetrack
CROSSREFS
Sequence in context: A097658 A067725 A213903 * A001106 A023551 A022787
KEYWORD
nonn,fini,full
AUTHOR
STATUS
approved