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.

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, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41

Offset

1,2

Comments

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.

Links

Table of n, a(n) for n=1..35.

Hugo Pfoertner, Examples of paths of maximum length.

Example

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

Crossrefs

Cf. A127399, A127400, A127401, A306181, A316201.

Cf. A346123-A346132 similar to this sequence with other sets of turning angles.

Sequence in context: A138561 A333841 A231236 * A151988 A039255 A039196

Adjacent sequences: A346128 A346129 A346130 * A346132 A346133 A346134

Keyword

nonn,walk,more

Author

Hugo Pfoertner and Markus Sigg, Aug 01 2021

Status

approved