cp's OEIS Frontend

A346131 Numbers 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.

%I A346131 #5 Aug 02 2021 07:55:52
%S A346131 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,
%T A346131 31,32,33,34,35,36,37,38,39,41
%N A346131 Numbers 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.
%C A346131 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.
%H A346131 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a346131.htm">Examples of paths of maximum length</a>.
%e A346131 See link for illustrations of terms corresponding to diameters D < 3.53.
%Y A346131 Cf. A127399, A127400, A127401, A306181, A316201.
%Y A346131 Cf. A346123-A346132 similar to this sequence with other sets of turning angles.
%K A346131 nonn,walk,more
%O A346131 1,2
%A A346131 _Hugo Pfoertner_ and _Markus Sigg_, Aug 01 2021