cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A187679 "Connect the dots": Minimal number of circular arcs needed to connect all points of an n X n grid of points.

This page as a plain text file.
%I A187679 #13 Mar 15 2021 21:30:58
%S A187679 1,1,3,3,5,6,9
%N A187679 "Connect the dots": Minimal number of circular arcs needed to connect all points of an n X n grid of points.
%C A187679 a(7)=9 is only a conjecture at present. I include it in the Data line to disambiguate this sequence from its neighbors.
%C A187679 For straight line segments the answer is conjectured to be 2n-2 for all n >=3, with a(1)=1, a(2)=3.
%H A187679 S. W. Golomb and John Selfridge, <a href="http://www.ams.org/mathscinet-getitem?mr=268063">Unicursal Polygonal Paths and Other Graphs on Point Lattices</a>, Pi Mu Epsilon Journal 5 (1970) 107-117.
%H A187679 Ed Pegg, Jr., <a href="http://www.mathpuzzle.com/dots.html">Connect the dots - Arcs</a>
%K A187679 nonn,more
%O A187679 1,3
%A A187679 _N. J. A. Sloane_, Mar 12 2011