login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Table of n, a(n) for n=1..7.

S. W. Golomb and John Selfridge, Unicursal Polygonal Paths and Other Graphs on Point Lattices, Pi Mu Epsilon Journal 5 (1970) 107-117.

Ed Pegg, Jr., Connect the dots - Arcs

CROSSREFS

Sequence in context: A138373 A011976 A060022 * A048274 A059892 A241090

Adjacent sequences:  A187676 A187677 A187678 * A187680 A187681 A187682

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Mar 12 2011

STATUS

approved

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 July 26 16:44 EDT 2021. Contains 346294 sequences. (Running on oeis4.)