[go: up one dir, main page]

login
A187679
"Connect the dots": Minimal number of circular arcs needed to connect all points of an n X n grid of points.
1
1, 1, 3, 3, 5, 6, 9
OFFSET
1,3
COMMENTS
a(7)=9 is only a conjecture at present. I include it in the Data line to disambiguate this sequence from its neighbors.
For straight line segments the answer is conjectured to be 2n-2 for all n >=3, with a(1)=1, a(2)=3.
LINKS
S. W. Golomb and John Selfridge, Unicursal Polygonal Paths and Other Graphs on Point Lattices, Pi Mu Epsilon Journal 5 (1970) 107-117.
CROSSREFS
Sequence in context: A138373 A011976 A060022 * A048274 A351012 A059892
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Mar 12 2011
STATUS
approved