OFFSET
0,3
COMMENTS
Start with spiral lattice generated by (k^2 * cos(k*theta), k^2 * sin(k*theta)) for theta being the golden angle (A131988) and k = 0, 1, 2, 3, ... .
Next, starting at point (0,0), move to the closest unvisited point. a(n) is the index k corresponding to the point reached after n moves.
Will all points of the lattice be visited?
EXAMPLE
Below is table of Cartesian coordinates of the first 10 points:
k x(k) y(k)
---------------
0 0.00 0.00
1 -0.74 0.68
2 0.35 -3.98
3 5.48 7.14
4 -15.76 -2.79
5 21.09 -13.42
6 -9.35 34.77
7 -22.58 -43.48
8 60.12 21.95
9 -74.87 30.91
We start at point (0.00, 0.00) that corresponds to k = 0, therefore a(0) = 0.
Unvisited point closest to (0.00, 0.00) is (-0.74, 0.68) corresponding to k = 1, therefore a(1) = 1.
Next points in the sequence correspond to k = 2, 3, and 4.
Unvisited point closest to k = 4 (-15.76, -2.79) is (-9.35, 34.77) corresponding to k = 6, therefore a(5) = 6.
Unvisited point closest to k = 6 (-9.35, 34.77) is (21.09, -13.43) corresponding to k = 5, therefore a(6) = 5.
CROSSREFS
KEYWORD
nonn
AUTHOR
Witold Tatkiewicz, Jul 06 2026
STATUS
approved
