%I A127399
%S A127399 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
%N 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.
%C A127399 The extension of the contest problem to larger sets of hinge angles was 
               proposed by James Buddenhagen (jbuddenh(AT)gmail.com). A link to 
               the contest rules is given in A127400. Results up to n=32 were found 
               by Markus Sigg (mail(AT)MarkusSigg.de). 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.
%H A127399 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a127399.pdf">
               Visualization of longest zigzag paths fitting into circle of diameter 
               2.</a>
%Y A127399 Cf. A127400 [solutions for container diameter 3], A127401 [solutions 
               for container diameter 4], A122223, A122224, A122226 [solutions for 
               hinge angles excluded from contest].
%Y A127399 Sequence in context: A110633 A119250 A059773 this_sequence A151689 A088438 
               A097265
%Y A127399 Adjacent sequences: A127396 A127397 A127398 this_sequence A127400 A127401 
               A127402
%K A127399 hard,more,nonn
%O A127399 2,1
%A A127399 Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 12 2007