

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.


3




OFFSET

3,1


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.


LINKS

Table of n, a(n) for n=3..9.


CROSSREFS

Cf. A127399 [solutions for container diameter 2], A127400 [solutions for container diameter 3], A122223, A122224, A122226 [solutions for hinge angles excluded from contest].
Sequence in context: A307167 A238228 A214504 * A256786 A106135 A058073
Adjacent sequences: A127398 A127399 A127400 * A127402 A127403 A127404


KEYWORD

hard,more,nonn


AUTHOR

Hugo Pfoertner, Jan 12 2007


EXTENSIONS

Corrected comment to show increased lower bound for a(12). [ Hugo Pfoertner, May 21 2011]


STATUS

approved



