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