

A127399


Number of segments of the longest possible zigzag paths fitting into a circle of diameter 2 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.


4



2, 6, 4, 6, 7, 7, 8, 11, 9, 11, 12, 14, 13, 17, 16, 19, 20, 20, 23, 23, 23, 27, 27, 28, 29
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,1


COMMENTS

The extension of the contest problem to larger sets of hinge angles was proposed by James R. Buddenhagen. A link to the contest rules is given in A127400. Results up to n=32 were found by Markus Sigg. Known lower bounds for the next terms are a(27)>=29, a(28)>=32, a(29)>=34, a(30>=34, a(31)>=34, a(32)>=39.


LINKS

Table of n, a(n) for n=2..26.
Hugo Pfoertner, Visualization of longest zigzag paths fitting into circle of diameter 2.


CROSSREFS

Cf. A127400 [solutions for container diameter 3], A127401 [solutions for container diameter 4], A122223, A122224, A122226 [solutions for hinge angles excluded from contest].
Sequence in context: A240232 A119250 A059773 * A240751 A212283 A247566
Adjacent sequences: A127396 A127397 A127398 * A127400 A127401 A127402


KEYWORD

hard,more,nonn


AUTHOR

Hugo Pfoertner, Jan 12 2007


STATUS

approved



