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.
Original entry on oeis.org
5, 61, 677, 2533, 7705, 17269, 37161, 65089, 111877, 174545, 274213
Offset: 0
A373110
Number of 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.
Original entry on oeis.org
5, 22, 54, 99, 159, 232, 320, 421, 537, 666, 810, 967, 1139, 1324, 1524, 1737, 1965, 2206, 2462, 2731, 3015, 3312, 3624, 3949
Offset: 0
A384703
On a 2 X n grid of vertices, draw a circle through every unordered triple of non-collinear vertices: a(n) is the number of distinct edges in the planar graph formed from the intersections of the circles.
Original entry on oeis.org
0, 4, 54, 416, 2182, 7884, 23294, 56982, 126310, 253564, 477462, 844524, 1424316
Offset: 1
A373107
Number of regions 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.
Original entry on oeis.org
12, 136, 932, 3252, 9144, 20032, 41260, 71832, 121460, 188656, 291488
Offset: 0
A385162
Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join a circle through every unordered triple of non-collinear points: a(n) is the number of distinct (curved) edges formed from the intersections of the circles.
Original entry on oeis.org
4, 184, 8956, 79272, 455664, 1420624, 4576632
Offset: 1
- Scott R. Shannon, Image for n = 2. The 4 x 2 = 8 starting points are shown as white dots.
A373109
Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, 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.
Original entry on oeis.org
8, 4, 40, 76, 20, 60, 492, 304, 56, 20, 88, 1696, 1136, 252, 64, 16, 124, 4196, 3536, 1052, 204, 28, 4, 128, 8940, 7948, 2448, 496, 68, 0, 4, 172, 16464, 17628, 5560, 1268, 164, 4, 144, 28424, 30884, 9964, 2064, 312, 24, 8, 0, 8, 196, 46844, 51840, 17832, 4112, 556, 60, 20
Offset: 0
The table begins:
8, 4;
40, 76, 20;
60, 492, 304, 56, 20;
88, 1696, 1136, 252, 64, 16;
124, 4196, 3536, 1052, 204, 28, 4;
128, 8940, 7948, 2448, 496, 68, 0, 4;
172, 16464, 17628, 5560, 1268, 164, 4;
144, 28424, 30884, 9964, 2064, 312, 24, 8, 0, 8;
196, 46844, 51840, 17832, 4112, 556, 60, 20;
216, 71944, 80760, 28468, 6272, 856, 136, 0, 4;
264, 106588, 126856, 45148, 10780, 1628, 172, 32, 20;
.
.
Showing 1-6 of 6 results.
Comments