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