A360354 -id:A360354 - cp's OEIS frontend

A360351 Number of vertices among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

5, 77, 1045, 6885, 30265, 104421, 309973, 800185, 1862053

Offset: 2

Scott R. Shannon, Feb 03 2023

A circle is constructed for every pair of points on the n X n grid, the points lying at the ends of a diameter of the circle. The number of distinct circles constructed from the n X n grid is A360350(n).

Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
N. J. A. Sloane, New Gilbreath Conjectures, Sum and Erase, Dissecting Polygons, and Other New Sequences, Doron Zeilberger's Exper. Math. Seminar, Rutgers, Sep 14 2023: Video, Slides, Updates. (Mentions this sequence.)

Cf. A360352 (regions), A360353 (edges), A360354 (k-gons), A360350 (distinct circles), A359932.

a(n) = A360353(n) - A360352(n) + 1 by Euler's formula.

A360352 Number of regions among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Original entry on oeis.org

12, 168, 1536, 8904, 36880, 123468, 358036, 912776, 2105976

Offset: 2

Scott R. Shannon, Feb 04 2023

A circle is constructed for every pair of points on the n X n grid, the points lying at the ends of a diameter of the circle. The number of distinct circles constructed from the n X n grid is A360350(n).

Scott R. Shannon, Image for n = 2. In this and other images the n X n grid points are shown as white dots.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Scott R. Shannon, Image for n = 6.
N. J. A. Sloane, New Gilbreath Conjectures, Sum and Erase, Dissecting Polygons, and Other New Sequences, Doron Zeilberger's Exper. Math. Seminar, Rutgers, Sep 14 2023: Video, Slides, Updates. (Mentions this sequence.)

Cf. A360351 (vertices), A360353 (edges), A360354 (k-gons), A360350 (distinct circles), A359933.

a(n) = A360353(n) - A360351(n) + 1 by Euler's formula.

A360350 Number of distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Original entry on oeis.org

5, 26, 79, 185, 366, 653, 1077, 1678, 2494, 3571, 4959, 6718, 8889, 11541, 14740, 18553, 23027, 28278, 34351, 41352, 49356, 58454, 68732, 80330, 93304, 107757, 123815, 141605, 161211, 182795, 206393, 232190, 260331, 290907, 324090, 360080, 398856, 440655, 485655

Offset: 2

Scott R. Shannon, Feb 03 2023

nonn

A circle is constructed for every pair of points on the n X n grid, the points lying at the ends of a diameter of the circle.
No formula for a(n) is known.
See A360351 and A360352 for images of the resulting vertices and regions.

N. J. A. Sloane, New Gilbreath Conjectures, Sum and Erase, Dissecting Polygons, and Other New Sequences, Doron Zeilberger's Exper. Math. Seminar, Rutgers, Sep 14 2023: Video, Slides, Updates. (Mentions this sequence.)

Cf. A360351 (vertices), A360352 (regions), A360353 (edges), A360354 (k-gons), A359931.

a(n) = { my (p = vector(n^2, k, (k-1)%n + ((k-1)\n)*I)); #setbinop((i,j)->[i+j, norm(i-j)], p)-n^2; } \\ Rémy Sigrist, Sep 24 2023

More terms from Rémy Sigrist, Sep 24 2023

A360353 Number of edges among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Original entry on oeis.org

16, 244, 2580, 15788, 67144, 227888, 668008, 1712960, 3968028

Offset: 2

Scott R. Shannon, Feb 04 2023

A circle is constructed for every pair of points on the n X n grid, the points lying at the ends of a diameter of the circle. The number of distinct circles constructed from the n X n grid is A360350(n).

See A360351 and A360352 for images of the circles.

Cf. A360351 (vertices), A360352 (regions), A360354 (k-gons), A360350 (distinct circles), A359934.

a(n) = A360351(n) + A360352(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).

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).

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 4n points placed on the sides of a square when every pair of the 4 + 4n 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

Scott R. Shannon, May 25 2024

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.

See A373106 and A373107 for images of the circles.

			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;
.
.

Cf. A373106 (vertices), A373107 (regions), A373108 (edges), A373110 (circles), A372980, A372734, A359009, A362236, A360354.

Sum of row n = A373107(n).

cp's OEIS Frontend

A360351 Number of vertices among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A360352 Number of regions among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A360350 Number of distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Extensions

A360353 Number of edges among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

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

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula