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.

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.

Original entry on oeis.org

17, 249, 1381, 4745, 12581, 26861, 51649, 89357, 145501, 225621, 335497
Offset: 1

Views

Author

Scott R. Shannon, Apr 12 2023

Keywords

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.

Crossrefs

Cf. A362234 (regions), A362235 (edges), A362236 (k-gons), A139275 (distinct circles), A354605, A359932.

Formula

a(n) = A362235(n) - A362234(n) + 1 by Euler's formula.