cp's OEIS Frontend

A346130 Numbers m such that no self-avoiding walk that can make turns from the set 0, +-Pi/5, +-2*Pi/5, +-3*Pi/5, +-4*Pi/5, of length m + 1 fits into the smallest circle that can enclose a walk of length m.

%I A346130 #7 Aug 02 2021 02:29:24
%S A346130 1,2,3,4,5,7,8,9,10,11,13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,
%T A346130 29,31,32,34,35,36,37,38,40
%N A346130 Numbers m such that no self-avoiding walk that can make turns from the set 0, +-Pi/5, +-2*Pi/5, +-3*Pi/5, +-4*Pi/5, of length m + 1 fits into the smallest circle that can enclose a walk of length m.
%C A346130 Closed walks (see A316200) are allowed. The only known closed walk that fits into a smaller enclosing circle than any open walk of the same length occurs for length 8.
%H A346130 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a346130.htm">Examples of paths of maximum length</a>.
%e A346130 See link for illustrations of terms corresponding to diameters D < 3.592.
%Y A346130 Cf. A127399, A127400, A127401, A306180, A316200.
%Y A346130 Cf. A346123-A346132 similar to this sequence with other sets of turning angles.
%K A346130 nonn,walk,more
%O A346130 1,2
%A A346130 _Hugo Pfoertner_ and _Markus Sigg_, Aug 01 2021