cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A380812 Sequence of x-coordinates of the lexicographically earliest (according to the spiral numbering of the square grid; see comments) infinite Racetrack trajectory (using von Neumann neighborhood) on the square grid.

Original entry on oeis.org

0, 1, 2, 2, 1, 0, -1, -1, -1, -1, 0, 1, 2, 2, 2, 1, 0, -1, -2, -3, -3, -2, -1, 0, 1, 3, 4, 4, 4, 3, 2, 1, -1, -3, -4, -4, -4, -4, -3, -2, 0, 2, 4, 5, 5, 4, 3, 2, 0, -2, -4, -5, -5, -5, -5, -4, -3, -1, 1, 3, 4, 4, 3, 2, 1, -1, -3, -5, -6, -6, -5, -3, 0, 3, 6, 8
Offset: 0

Views

Author

Pontus von Brömssen, Feb 05 2025

Keywords

Comments

The car starts at the origin and thereafter moves, according to the rules of Racetrack with von Neumann neighborhood (see A351042 or Wikipedia link), to the unvisited square that has the lowest spiral number, provided that it is possible to extend the trajectory to an infinite one. The spiral numbering is described in A316328.
The trajectory in A351043 is defined in a similar way, but it does not backtrack when it gets stuck, so it is finite, ending after 146 steps. The trajectory here is identical to the trajectory in A351043 for the first 144 steps.

Examples

			In the 144th step, the car moves from (-9,-8) to (-6,-6) (a(144) = A380813(144) = -6). A priori, the next possible positions (ordered by increasing spiral number) are (-3,-3), (-4,-4), (-3,-4), (-2,-4), and (-3,-5). Of these, (-3,-3) has already been visited (after the 103rd step), so the next choice is (-4,-4). From that position, however, the car is forced to move to (-2,-2) (all other alternatives have already been visited), and from (-2,-2) there are no available positions not already visited (so the trajectory in A351043 ends there). The next option (-3,-4) is also a dead end, but from (-2,-4) it is possible to continue forever, so a(145) = -2 and A380813(145) = -4.
		

Crossrefs

Cf. A174344, A316328, A351042, A351043, A380813 (y-coordinates), A380814.

Formula

a(n) = A174344(A351043(n)+1) for n <= 144.

A380813 Sequence of y-coordinates of the lexicographically earliest (according to the spiral numbering of the square grid; see comments) infinite Racetrack trajectory (using von Neumann neighborhood) on the square grid.

Original entry on oeis.org

0, 0, -1, -2, -3, -3, -2, -1, 1, 2, 3, 3, 2, 1, 0, -1, -1, 0, 2, 3, 4, 5, 5, 4, 2, 0, -2, -4, -5, -6, -6, -5, -4, -2, 0, 2, 4, 5, 6, 6, 6, 5, 3, 1, -1, -3, -4, -4, -4, -3, -1, 1, 3, 5, 6, 7, 7, 7, 6, 4, 2, 0, -2, -3, -4, -5, -5, -4, -3, -2, -1, 0, 1, 1, 0, -1
Offset: 0

Views

Author

Pontus von Brömssen, Feb 05 2025

Keywords

Comments

See A380812 for more details.
See A351042 or Wikipedia link for a description of the rules of Racetrack.
The trajectory in A351043 is defined in a similar way, but it does not backtrack when it gets stuck, so it is finite, ending after 146 steps. The trajectory here is identical to the trajectory in A351043 for the first 144 steps, and it turns out that the y-coordinates agree also for the last 2 steps.

Crossrefs

Cf. A274923, A351042, A351043, A380812 (x-coordinates), A380814.

Formula

a(n) = A274923(A351043(n)+1) for n <= 146.
Showing 1-2 of 2 results.