A371376 -id:A371376 - cp's OEIS frontend

A371373 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of vertices formed.

1, 2, 4, 4, 25, 19, 140, 144, 460, 500, 1210, 901, 2587, 2758, 4696, 5136, 8687, 7831, 14136, 14600, 21610, 22572, 32246, 31033, 46125, 47450, 63748, 65772, 86565, 82051, 114824, 117760, 148930, 152796, 190820, 189973, 241055, 247038, 300028, 306840, 369943, 367711, 451586, 459448

Offset: 1

Scott R. Shannon, Mar 20 2024

nonn

The number of circles that cross to form the intersections follows a similar pattern to that seen in A371254; see that sequence for further information. The details of the crossing counts are given in A371377.

Scott R. Shannon, Image for n = 3. In this and other images the initial circle on which the n points are placed is drawn in a thicker white line for clarity.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Scott R. Shannon, Image for n = 6.
Scott R. Shannon, Image for n = 7.
Scott R. Shannon, Image for n = 8.
Scott R. Shannon, Image for n = 9.
Scott R. Shannon, Image for n = 10.
Scott R. Shannon, Image for n = 11.
Scott R. Shannon, Image for n = 12. Note the 6 circle intersections shown in blue.
Scott R. Shannon, Image for n = 15. Note the 5 circle intersections shown in green.
Scott R. Shannon, Image for n = 20.
Scott R. Shannon, Image for n = 24.
Scott R. Shannon, Image for n = 30. Note the 9 circle intersections shown in violet.

Cf. A371374 (regions), A371375 (edges), A371376 (k-gons), A371377 (vertex crossings), A371254, A007569, A358746, A331702.

a(n) = A371375(n) - A371374(n) + 1 by Euler's formula.

A371374 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of regions formed.

Original entry on oeis.org

1, 1, 9, 9, 51, 48, 211, 217, 612, 651, 1475, 1248, 3017, 3193, 5415, 5793, 9623, 9000, 15429, 15901, 23352, 24311, 34501, 33840, 49001, 50337, 67365, 69385, 91003, 87720, 120219, 123169, 155430, 159291, 198521, 198792, 250121, 256121, 310635, 317441, 382203, 382032, 465691, 473573

Offset: 1

Scott R. Shannon, Mar 20 2024

nonn

See A371373 and A371254 for further information. The details of the number of regions with k sides is given in A371376.

Scott R. Shannon, Image for n = 3. In this and other images the initial circle and n points are shown in white for clarity.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Scott R. Shannon, Image for n = 6.
Scott R. Shannon, Image for n = 7.
Scott R. Shannon, Image for n = 8.
Scott R. Shannon, Image for n = 9.
Scott R. Shannon, Image for n = 10.
Scott R. Shannon, Image for n = 11.
Scott R. Shannon, Image for n = 12.
Scott R. Shannon, Image for n = 15.
Scott R. Shannon, Image for n = 20.
Scott R. Shannon, Image for n = 24.
Scott R. Shannon, Image for n = 30.

Cf. A371373 (vertices), A371375 (edges), A371376 (k-gons), A371377 (vertex crossings), A371254, A371253, A006533, A358782, A359046.

a(n) = A371375(n) - A371373(n) + 1 by Euler's formula.

A371375 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of (curved) edges formed.

Original entry on oeis.org

1, 2, 12, 12, 75, 66, 350, 360, 1071, 1150, 2684, 2148, 5603, 5950, 10110, 10928, 18309, 16830, 29564, 30500, 44961, 46882, 66746, 64872, 95125, 97786, 131112, 135156, 177567, 169770, 235042, 240928, 304359, 312086, 389340, 388764, 491175, 503158, 610662, 624280, 752145, 749742, 917276

Offset: 1

Scott R. Shannon, Mar 20 2024

nonn

See A371373 and A371374 for images of the graphs.

Cf. A371373 (vertices), A371374 (regions), A371376 (k-gons), A371377 (vertex crossings), A371255, A135565, A358783, A359047.

a(n) = A371373(n) + A371374(n) - 1 by Euler's formula.

A372617 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 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle, using only a compass.

Original entry on oeis.org

0, 7, 3, 70, 45, 3, 6, 312, 273, 33, 6, 1017, 1119, 186, 36, 3, 0, 1, 6, 2943, 4092, 702, 150, 15, 3, 1, 6, 6210, 8556, 1941, 351, 45, 3, 3, 6, 12946, 20034, 4632, 735, 99, 9, 6, 20925, 32685, 7944, 1435, 162, 27, 18, 37704, 59520, 15375, 2589, 324, 84, 30, 55326, 87138, 22626, 4456, 474, 96, 3

Offset: 0

Scott R. Shannon, May 07 2024

A circle is constructed for every pair of the 3 + 3*n points, the first point defines the circle's center while the second the radius distance.

See A372614 and A372615 for images of the circles.

			The table begins:
0, 7;
3, 70, 45, 3;
6, 312, 273, 33;
6, 1017, 1119, 186, 36, 3, 0, 1;
6, 2943, 4092, 702, 150, 15, 3, 1;
6, 6210, 8556, 1941, 351, 45, 3, 3;
6, 12946, 20034, 4632, 735, 99, 9;
6, 20925, 32685, 7944, 1435, 162, 27;
18, 37704, 59520, 15375, 2589, 324, 84;
30, 55326, 87138, 22626, 4456, 474, 96, 3;
30, 91923, 146121, 38817, 7777, 894, 135, 9, 9;
36, 118734, 189804, 51747, 10356, 1122, 183;
36, 185730, 299571, 84285, 16015, 2139, 261, 3, 3;
.
.

Cf. A372614 (vertices), A372615 (regions), A372616 (edges), A372682 (number of circles), A371376, A361623, A360354.

Sum of row n = A372615(n).

A371377 Irregular table read by rows: place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. T(n,k), k>=2, gives the number of vertices formed by the crossing of k arcs.

Original entry on oeis.org

0, 0, 0, 4, 0, 4, 10, 10, 0, 5, 6, 6, 0, 6, 1, 98, 35, 0, 0, 0, 7, 104, 32, 0, 0, 0, 8, 369, 81, 0, 0, 0, 0, 0, 10, 410, 80, 0, 0, 0, 0, 0, 10, 1034, 165, 0, 0, 0, 0, 0, 0, 0, 11, 768, 84, 0, 0, 36, 0, 0, 0, 0, 12, 1, 2288, 286, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 2464, 280, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14

Offset: 1

Scott R. Shannon, Mar 20 2024

See A371373 and A371374 for images of the graphs.

			The table begins:
0;
0;
0, 4;
0, 4;
10, 10, 0, 5;
6, 6, 0, 6, 1;
98, 35, 0, 0, 0, 7;
104, 32, 0, 0, 0, 8;
369, 81, 0, 0, 0, 0, 0, 10;
410, 80, 0, 0, 0, 0, 0, 10;
1034, 165, 0, 0, 0, 0, 0, 0, 0, 11;
768, 84, 0, 0, 36, 0, 0, 0, 0, 12, 1;
2288, 286, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13;
2464, 280, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14;
4230, 420, 0, 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16;
4672, 448, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16;
7990, 680, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17;
7254, 450, 0, 0, 108, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 1;
13148, 969, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19;
13620, 960, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20;
20265, 1323, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22;
21230, 1320, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22;
30452, 1771, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23;
29376, 1416, 0, 0, 216, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 1;
43800, 2300, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25;
45136, 2288, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26;
.
.

Cf. A371373 (vertices), A371374 (regions), A371375 (edges), A371376 (k-gons), A371264, A335102, A007569, A358746, A331702.

Sum of row(n) = A371373(n).

A372734 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 3 vertices and the equally spaced 3n points placed on the sides of an equilateral triangle when every pair of the 3 + 3n points are connected by a circle and where the points lie at the ends of the circle's diameter.

Original entry on oeis.org

0, 7, 12, 61, 9, 6, 6, 303, 108, 9, 9, 3, 18, 771, 603, 150, 15, 9, 0, 1, 24, 1722, 1740, 339, 81, 3, 0, 1, 30, 3789, 4326, 1104, 234, 18, 3, 36, 6907, 8274, 2193, 432, 45, 18, 66, 12012, 15504, 4173, 922, 105, 45, 3, 3, 90, 19860, 24774, 7389, 1773, 150, 30, 48, 30594, 39852, 12438, 2998, 387, 48

Offset: 0

Scott R. Shannon, May 12 2024

A circle is constructed for every pair of the 3 + 3*n points, the two points lying at the ends of a diameter of the circle.

See A372731 and A372732 for images of the circles.

			The table begins:
0, 7;
12, 61, 9, 6;
6, 303, 108, 9, 9, 3;
18, 771, 603, 150, 15, 9, 0, 1;
24, 1722, 1740, 339, 81, 3, 0, 1;
30, 3789, 4326, 1104, 234, 18, 3;
36, 6907, 8274, 2193, 432, 45, 18;
66, 12012, 15504, 4173, 922, 105, 45, 3, 3;
90, 19860, 24774, 7389, 1773, 150, 30;
48, 30594, 39852, 12438, 2998, 387, 48;
96, 45456, 59019, 18669, 4429, 609, 93, 3, 6;
90, 66633, 86088, 29136, 6840, 1164, 195, 6;
120, 90210, 121614, 40035, 9160, 1362, 177, 12, 9;
108, 124245, 167646, 57048, 14377, 1989, 300, 33, 15;
.
.

Cf. A372731 (vertices), A372732 (regions), A372733 (edges), A372735 (number of circles), A372617, A371376, A361623, A360354.

Sum of row(n) = A372732(n).

A372980 Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, 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, using only a compass.

Original entry on oeis.org

16, 29, 272, 260, 80, 12, 4, 1708, 2253, 528, 120, 20, 4, 5200, 7636, 2136, 432, 44, 20, 8, 13732, 20788, 5712, 1120, 184, 17, 8, 31576, 49284, 14060, 3180, 584, 108, 16, 64748, 103557, 30372, 6472, 980, 172, 4, 12, 103368, 166804, 49920, 11196, 1660, 260, 48, 16, 181376, 296388, 88916, 19844, 3128, 445, 64, 20

Offset: 0

Scott R. Shannon, May 19 2024

A circle is constructed for every pair of the 4 + 4*n points, the first point defines the circle's center while the second the radius distance.
Unlike A372617, a similar sequence but with vertices on an equilateral triangle, for the terms studied no graph has 2-edged regions.
See A372977 and A372978 for images of the circles.

			The table begins:
16, 29;
272, 260, 80, 12, 4;
1708, 2253, 528, 120, 20, 4;
5200, 7636, 2136, 432, 44, 20, 8;
13732, 20788, 5712, 1120, 184, 17, 8;
31576, 49284, 14060, 3180, 584, 108, 16;
64748, 103557, 30372, 6472, 980, 172, 4, 12;
103368, 166804, 49920, 11196, 1660, 260, 48, 16;
181376, 296388, 88916, 19844, 3128, 445, 64, 20;
.
.

Cf. A372977 (vertices), A372978 (regions), A372979 (edges), A372981 (circles), A372617, A371376, A361623, A360354.

Sum of row n = A372978(n).

cp's OEIS Frontend

A371373 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of vertices formed.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A371374 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of regions formed.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A371375 Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of (curved) edges formed.

Views

Author

Keywords

Comments

Crossrefs

Formula

A372617 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 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle, using only a compass.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A372980 Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, 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, using only a compass.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula