

A346127


Numbers m such that no selfavoiding 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.


2



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

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.


LINKS

Table of n, a(n) for n=1..37.
Hugo Pfoertner, Examples of paths of maximum length.


EXAMPLE

See link for illustrations of terms corresponding to diameters D < 4.126.


CROSSREFS

Cf. A127399, A127400, A127401, A306177, A316197.
Cf. A346123A346132 similar to this sequence with other sets of turning angles.
Sequence in context: A039248 A039190 A039142 * A039103 A228082 A153088
Adjacent sequences: A346124 A346125 A346126 * A346128 A346129 A346130


KEYWORD

nonn,walk,more


AUTHOR

Hugo Pfoertner and Markus Sigg, Aug 01 2021


STATUS

approved



