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

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 31, 32, 34, 35, 36, 37, 38, 40

Offset

1,2

Comments

Closed walks (see A316200) are allowed. The only known closed walk that fits into a smaller enclosing circle than any open walk of the same length occurs for length 8.

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.592.

Crossrefs

Cf. A127399, A127400, A127401, A306180, A316200.

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

Sequence in context: A002855 A303234 A175233 * A121229 A286291 A286926

Adjacent sequences: A346127 A346128 A346129 * A346131 A346132 A346133

Keyword

nonn,walk,more

Author

Hugo Pfoertner and Markus Sigg, Aug 01 2021

Status

approved