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.

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.

This page as a plain text file.
%I A373106 #7 May 26 2024 08:20:32
%S A373106 5,61,677,2533,7705,17269,37161,65089,111877,174545,274213
%N 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.
%C A373106 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.
%H A373106 Scott R. Shannon, <a href="/A373106/a373106.jpg">Image for n = 0</a>. In this and other images the 4 + 4*n vertices forming the square are drawn larger for clarity.
%H A373106 Scott R. Shannon, <a href="/A373106/a373106_1.jpg">Image for n = 1</a>.
%H A373106 Scott R. Shannon, <a href="/A373106/a373106_2.jpg">Image for n = 2</a>.
%H A373106 Scott R. Shannon, <a href="/A373106/a373106_3.jpg">Image for n = 3</a>.
%F A373106 a(n) = A373108(n) - A373107(n) + 1 by Euler's formula.
%Y A373106 Cf. A373107 (regions), A373108 (edges), A373109 (k-gons), A373110 (circles), A372977, A372731, A358746, A362233, A360351.
%K A373106 nonn,more
%O A373106 0,1
%A A373106 _Scott R. Shannon_, May 25 2024