Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Apr 14 2023 07:32:21
%S 17,249,1381,4745,12581,26861,51649,89357,145501,225621,335497
%N 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.
%C 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).
%C No formula for a(n) is currently known.
%H Scott R. Shannon, <a href="/A362233/a362233.jpg">Image for n = 1</a>.
%H Scott R. Shannon, <a href="/A362233/a362233_1.jpg">Image for n = 2</a>.
%H Scott R. Shannon, <a href="/A362233/a362233_2.jpg">Image for n = 3</a>.
%H Scott R. Shannon, <a href="/A362233/a362233_3.jpg">Image for n = 4</a>.
%F a(n) = A362235(n) - A362234(n) + 1 by Euler's formula.
%Y Cf. A362234 (regions), A362235 (edges), A362236 (k-gons), A139275 (distinct circles), A354605, A359932.
%K nonn,more
%O 1,1
%A _Scott R. Shannon_, Apr 12 2023