|
Search: id:A127399
|
|
|
| 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. |
|
+0 3
|
|
| 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; listen)
|
|
|
Search completed in 0.002 seconds
|