login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A373106 Number of vertices among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square when every pair of the 4 + 4*n points are connected by a circle and where the points lie at the ends of the circle's diameter. 5
5, 61, 677, 2533, 7705, 17269, 37161, 65089, 111877, 174545, 274213 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
A circle is constructed for every pair of the 4 + 4*n points, the two points lying at the ends of a diameter of the circle.
LINKS
Scott R. Shannon, Image for n = 0. In this and other images the 4 + 4*n vertices forming the square are drawn larger for clarity.
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
FORMULA
a(n) = A373108(n) - A373107(n) + 1 by Euler's formula.
CROSSREFS
Cf. A373107 (regions), A373108 (edges), A373109 (k-gons), A373110 (circles), A372977, A372731, A358746, A362233, A360351.
Sequence in context: A099666 A350973 A189444 * A217811 A217280 A236955
KEYWORD
nonn,more
AUTHOR
Scott R. Shannon, May 25 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 26 06:40 EDT 2024. Contains 373715 sequences. (Running on oeis4.)