OFFSET
2,1
COMMENTS
Other than a(2) whose walk is comprised of 8 diagonal segments, all known terms are produced by 3- or 4-segment walks, including some with examples of both. It is conjectured that this holds true for all n >= 3.
For n = 2, the walk segments are the hypotenuses of noncongruent primitive Pythagorean triangles.
The offset is 2, because even though the graph could be defined in dimension 1 (the vertices would be the points of Z, with each point connected to its two neighbors), it would not contain any closed paths.
LINKS
Charles L. Hohn, a(2), graphical view
Charles L. Hohn, a(3), graphical view, animated
EXAMPLE
a(2) = 327080 because [3636, 40723] + [8844, 39917] + [11603, -39204] + [38076, -14893] + [-37523, -16236] + [35844, -19667] + [-34387, -22116] + [-26093, 31476] = [0, 0] and 8 segments * length 40885 = 327080, which is the smallest example for n = 2.
a(3) = 84: [16, 11, 8] + [-13, 4, 16] + [-8, -19, -4] + [5, 4, -20] = [0, 0, 0] and 4 * 21 = 84.
a(4) = 52: [8, 8, 5, 4] + [-9, -6, 6, 4] + [-7, -4, -10, 2] + [8, 2, -1, -10] = [0, 0, 0, 0] and 4 * 13 = 52.
CROSSREFS
KEYWORD
nonn
AUTHOR
Charles L. Hohn, Jul 30 2025
STATUS
approved
