proposed
approved
proposed
approved
editing
proposed
1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 28, 29, 30, 31, 35, 37, 38, 39, 40, 41, 42, 43, 45, 47, 48
See link for illustrations of terms corresponding to diameters D < 4.055126.
allocated for Hugo PfoertnerNumbers m such that no self-avoiding walk that can make turns from the set +-Pi/7, +-3*Pi/7, +-5*Pi/7, of length m + 1 fits into the smallest circle that can enclose a walk of length m.
1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 28, 29, 30, 31, 35, 37, 38, 39, 40, 41, 42, 43, 45
1,2
Although closed walks (see A316197) 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/a346127.htm">Examples of paths of maximum length</a>.
See link for illustrations of terms corresponding to diameters D < 4.055.
allocated
nonn,walk,more
Hugo Pfoertner and Markus Sigg, Aug 01 2021
approved
editing
allocated for Hugo Pfoertner
allocated
approved