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

1, 2, 4, 5, 6, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41

Offset

1,2

Comments

Although closed walks (see A316199) 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..34.

Hugo Pfoertner, Examples of paths of maximum length.

Example

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

Crossrefs

Cf. A127399, A127400, A127401, A306179, A316199.

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

Sequence in context: A324639 A171599 A328594 * A366160 A288174 A280998

Adjacent sequences: A346126 A346127 A346128 * A346130 A346131 A346132

Keyword

nonn,walk,more

Author

Hugo Pfoertner and Markus Sigg, Aug 01 2021

Status

approved