login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A362233
Number of vertices among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.
5
17, 249, 1381, 4745, 12581, 26861, 51649, 89357, 145501, 225621, 335497
OFFSET
1,1
COMMENTS
A circle is constructed for every pair of the 1 + 4n points, the two points lying at the ends of a diameter of the circle. The number of distinct circles constructed from the points is A139275(n).
No formula for a(n) is currently known.
LINKS
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
FORMULA
a(n) = A362235(n) - A362234(n) + 1 by Euler's formula.
CROSSREFS
Cf. A362234 (regions), A362235 (edges), A362236 (k-gons), A139275 (distinct circles), A354605, A359932.
Sequence in context: A324358 A294608 A294810 * A214175 A309856 A201302
KEYWORD
nonn,more
AUTHOR
Scott R. Shannon, Apr 12 2023
STATUS
approved