This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
12, 14, 33, 19, 43, 44, 59 (list; graph; refs; listen; history; text; internal format)



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.


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


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




Hugo Pfoertner, Jan 12 2007


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



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 14:20 EST 2019. Contains 329979 sequences. (Running on oeis4.)