|
%I #11 Aug 08 2021 12:34:51
%S 1,3,4,7,8,9,10,12,14,15,16,19,20,22,23,24,25,27,31,32,34,37,38,39,40,
%T 42,43,44,45,48,49,55,56,57,58,60,61
%N Numbers m such that no self-avoiding walk of length m + 1 on the hexagonal lattice fits into the smallest circle that can enclose a walk of length m.
%C Open and closed walks are allowed. It is conjectured that all optimal paths are closed except for the trivial path of length 1. See the related conjecture in A122226.
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a346126.htm">Examples of paths of maximum length</a>.
%e See link for illustrations of terms corresponding to diameters D <= 8.
%Y Cf. A122226, A125852, A127399, A127400, A127401, A151541, A284869, A306176, A316196.
%Y Cf. A346123 (similar to this sequence, but for honeycomb net), A346124 (ditto for square lattice).
%Y Cf. A346125, A346127-A346132 (similar to this sequence, but with other sets of turning angles).
%K nonn,walk,more
%O 1,2
%A _Hugo Pfoertner_ and _Markus Sigg_, Jul 31 2021
|
