|
Search: id:A127401
|
|
|
| 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. |
|
+0
3
|
| |
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
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)>=70.
|
|
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: A101557 A019292 A022326 this_sequence A106135 A058073 A058951
Adjacent sequences: A127398 A127399 A127400 this_sequence A127402 A127403 A127404
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 12 2007
|
|
|
Search completed in 0.002 seconds
|
