A127401 Number of segments of the longest possible zigzag paths fitting into a circle of diameter 4 if the path with index n is constructed according to the rules of the "Snakes on a Plane" problem of Al Zimmermann's programming contest.

12, 14, 33, 19, 43, 44, 59, 50

Offset: 3

Author

Hugo Pfoertner, Jan 12 2007

Keywords

• nonn
• hard
• more

Comments

Links to the contest rules and to visualizations of the results are given in A127400. Known lower bounds for the next terms are a(10)>=50, a(11)>=77, a(12)>=71. [updated by Hugo Pfoertner, May 21 2011]

Links

• Hugo Pfoertner, Data supporting a(10)=50, October 2020.

Crossrefs

Cf. A127399 [solutions for container diameter 2], A127400 [solutions for container diameter 3], A122223, A122224, A122226 [solutions for hinge angles excluded from contest].

Extensions

a(10) from Hugo Pfoertner, Nov 01 2020