proposed

approved

editing

proposed

1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41

Cf. A127399, A127400, A127401, A306181, A316201, A346123-A346132.

Cf. A346123-A346132 similar to this sequence with other sets of turning angles.

allocated for Hugo PfoertnerNumbers m such that no self-avoiding walk that can make turns from the set +-Pi/11, +-3*Pi/11, +-5*Pi/11, +-7*Pi/11, +-9*Pi/11, of length m + 1 fits into the smallest circle that can enclose a walk of length m.

1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35

1,2

Although closed walks (see A316201) would be allowed, no closed walk that fits into a smaller enclosing circle than any open walk of the same length is known.

Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a346131.htm">Examples of paths of maximum length</a>.

See link for illustrations of terms corresponding to diameters D < 3.53.

Cf. A127399, A127400, A127401, A306181, A316201, A346123-A346132.

allocated

nonn,walk,more

Hugo Pfoertner and Markus Sigg, Aug 01 2021

approved

editing

allocated for Hugo Pfoertner

allocated

approved