A007678 -id:A007678 - cp's OEIS frontend

A344866 Number of polygons formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.

0, 1, 16, 99, 352, 925, 2016, 3871, 6784, 11097, 17200, 25531, 36576, 50869, 68992, 91575, 119296, 152881, 193104, 240787, 296800, 362061, 437536, 524239, 623232, 735625, 862576, 1005291, 1165024, 1343077, 1540800, 1759591, 2000896, 2266209, 2557072, 2875075, 3221856, 3599101, 4008544, 4451967

Offset: 1

Scott R. Shannon, Jun 01 2021

This is the odd-indexed subsequence of A344857. See A344857 for images of the polygons.

			a(3) = 16 as the five connected vertices form eleven polygons inside the regular pentagon while also forming five triangles outside the pentagon, giving sixteen polygons in total.

Harvey P. Dale, Table of n, a(n) for n = 1..1000
John Elias, Illustration of initial terms: Cubic Vertex Fractal
J. F. Rigby, Multiple intersections of diagonals of regular polygons, and related topics, Geom. Dedicata 9 (1980), 207-238.
Alexander Sidorenko, Explicit Formulas for Odd-Indexed Terms in A344899, A146212, and A344857.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A344857 (number for even and odd n), A344311, A344938, A007678, A341735 (number inside the n-gon), A344899 (number of edges).

A344938 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line, for k = 3, 4, ..., max_k.

Original entry on oeis.org

1, 4, 15, 0, 1, 36, 6, 70, 21, 7, 0, 1, 112, 64, 189, 108, 36, 18, 0, 0, 1, 270, 220, 50, 407, 352, 110, 55, 0, 0, 0, 0, 1, 624, 528, 884, 689, 325, 91, 0, 26, 0, 0, 0, 0, 1, 1162, 1092, 266, 14, 1530, 1545, 480, 270, 45, 0, 0, 0, 0, 0, 0, 0, 1, 2080, 2032, 416, 80

Offset: 3

Scott R. Shannon, Jun 03 2021

See A344857 for examples and images of the polygons.

			A pentagon with all vertices connected forms 10 triangles inside the pentagon, 5 triangles outside the pentagon, giving 15 triangles in all, and 1 smaller pentagon inside the pentagon, so row 3 is [15,0,1].
The table begins:
1;
4;
15,0,1;
36,6;
70,21,7,0,1;
112,64;
189,108,36,18,0,0,1;
270,220,50;
407,352,110,55,0,0,0,0,1;
624,528;
884,689,325,91,0,26,0,0,0,0,1;
1162,1092,266,14;
1530,1545,480,270,45,0,0,0,0,0,0,0,1;
2080,2032,416,80;
2567,2754,1003,374,17,68,0,0,0,0,0,0,0,0,1;
3402,3366,180,18,18;
3952,4807,1672,475,95,76,0,19,0,0,0,0,0,0,0,0,1;
5380,5360,1580,240,0,20;
5943,7392,2583,1260,21,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
7590,9020,2310,132,132,66;
9430,9775,4508,1518,253,46,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
11304,12288,2280,144;
13025,14650,6250,2375,200,75,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
16042,16952,5954,728,260,52;
17064,22464,7884,2700,567,189,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
21616,24192,7056,2016,168,28;
23751,29319,11281,3828,348,319,0,87,29,29,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
29880,29010,4140,540;
30814,39370,15314,5177,341,496,0,62,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
37440,42624,14240,3008,544,64;
41481,49335,19305,7854,891,363,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;

Cf. A344857 (total number of polygons), A344899 (number of edges), A146212 (number of vertices), A344866, A344311, A007678, A331450 (number of k-gons inside the regular n-gon).

Sum of row(n) = A344857(n) = A344311(n) + A007678(n).

A345459 Number of polygons formed when connecting all 4n points on the perimeter of an n X n square by infinite lines.

Original entry on oeis.org

0, 4, 80, 568, 2024, 6052, 12144, 26976, 45024, 76724, 116840, 191128, 245976, 388452, 501888, 661476, 870168, 1199724, 1402096, 1911384, 2188320, 2739280, 3371264, 4224288, 4617224, 5801372, 6780568

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Jun 20 2021

The width/height of the entire figure grows as ~ 2*n^3 for large n. See the Formula section below.

			a(2) = 80. Connecting the 8 perimeter points results in the creation of forty-eight 3-gons and eight 4-gons inside the square while creating twenty-four 3-gons outside the square, giving eighty polygons in total. See the linked images.

Scott R. Shannon, Image for n = 2. In this and other images the square's points are highlighted as white dots while the outer open regions, which are not counted, are darkened. The key for the edge-number coloring is shown at the top-left of the image.
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.

Cf. A255011 (number inside the square), A345648 (number outside the square), A345649 (number of vertices), A345650 (number of edges), A344993, A344857, A092098, A007678.

a(n) = A345650(n) - A345649(n) + 1.

Assuming the square is of size n x n centered on the origin the x (or y) offset for the eight outermost vertices is n^3 - 2*n^2 + 3*n/2, which have a corresponding y (or x) offset of n^2 - 3*n/2 + 1. The total distance from the origin of these vertices is sqrt(n^6 - 4*n^5 + 8*n^4 - 9*n^3 + 13*n^2/2 - 3*n + 1).

A359046 Number of distinct regions among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.

Original entry on oeis.org

1, 3, 7, 45, 66, 186, 267, 657, 721, 1501, 1893, 2772, 3654, 5727, 6511, 9969, 11340, 14850, 18051, 23921, 26755, 35201, 39975, 47280, 55776, 69863, 75385, 93017, 102864, 117810, 134541, 161217, 172921, 205293, 221271, 252828, 277242, 322811, 341017, 393721, 420702, 466074, 509379

Offset: 1

Scott R. Shannon, Dec 14 2022

nonn

See A331702 for further details.

No formula for a(n) is currently known.

Scott R. Shannon, Image for n = 2. In this and other images the points defining the n-sided regular polygon are show 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.
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 = 18.
Scott R. Shannon, Image for n = 21.
Scott R. Shannon, Image for n = 25.

Cf. A331702 (vertices), A359047 (edges), A359061 (k-gons), A358782, A007678.

a(n) = A359047(n) - A331702(n) + 1 by Euler's formula.

A359061 Irregular table read by rows: T(n,k) is the number of k-gons formed, k>=2, among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.

Original entry on oeis.org

3, 0, 7, 0, 16, 29, 0, 30, 35, 1, 0, 90, 96, 0, 105, 126, 35, 1, 0, 272, 304, 48, 32, 0, 1, 0, 315, 324, 81, 0, 0, 0, 1, 0, 460, 940, 60, 40, 0, 0, 0, 1, 0, 671, 858, 264, 88, 11, 0, 0, 0, 1, 0, 960, 1656, 108, 48, 0, 1144, 1807, 559, 130, 13, 0, 0, 0, 0, 0, 1, 0, 1960, 3136, 448, 168, 0, 14, 0, 0, 0, 0, 0, 1

Offset: 2

Scott R. Shannon, Dec 14 2022

See A331702 and A359046 for further details and images.

Conjecture: the only value for n which leads to the creation of 2-gons is n = 2. Despite values for n mod 6 = 0 forming intersecting arcs at the center of the n-gon, these are cut by other circles and thus create 3-gons or 4-gons. This is in contrast to values of n mod 4 = 0 in A359009 which do lead to the creation of 2-gons at the center of the figure from similar arcs.

			The table begins:
3;
0, 7;
0, 16, 29;
0, 30, 35, 1;
0, 90, 96;
0, 105, 126, 35, 1;
0, 272, 304, 48, 32, 0, 1;
0, 315, 324, 81, 0, 0, 0, 1;
0, 460, 940, 60, 40, 0, 0, 0, 1;
0, 671, 858, 264, 88, 11, 0, 0, 0, 1;
0, 960, 1656, 108, 48;
0, 1144, 1807, 559, 130, 13, 0, 0, 0, 0, 0, 1;
0, 1960, 3136, 448, 168, 0, 14, 0, 0, 0, 0, 0, 1;
0, 2100, 3270, 945, 180, 15, 0, 0, 0, 0, 0, 0, 0, 1;
0, 3088, 5584, 896, 368, 16, 16, 0, 0, 0, 0, 0, 0, 0, 1;
0, 3400, 5814, 1513, 493, 85, 34, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 4536, 8712, 1224, 288, 54, 36;
0, 5586, 8797, 2774, 665, 76, 152, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 7940, 12480, 2440, 960, 100, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 7833, 14175, 3486, 1050, 147, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 10428, 19448, 3850, 1408, 22, 44, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;

Scott R. Shannon, Image for n = 17.
Scott R. Shannon, Image for n = 23.
Scott R. Shannon, Image for n = 24.

Cf. A331702 (vertices), A359046 (regions), A359047 (edges), A359009, A358782, A007678.

Sum of row n = A359046(n).

A101364 In the interior of a regular n-gon with all diagonals drawn, the number of points where exactly four diagonals intersect.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 12, 0, 0, 0, 0, 0, 54, 0, 0, 0, 0, 0, 264, 0, 0, 0, 0, 0, 420, 0, 0, 0, 0, 0, 396, 0, 0, 0, 0, 0, 1134, 0, 0, 0, 0, 0, 1200, 0, 0, 0, 0, 0, 1296, 0, 0, 0, 0, 0, 3780, 0, 0, 0, 0, 0, 2310, 0, 0, 0, 0, 0, 2520, 0, 0, 0, 0, 0, 3276, 0, 0, 0, 0, 0, 3612, 0, 0, 0, 0, 0, 4050

Offset: 3

Graeme McRae, Dec 26 2004, revised Feb 23 2008

nonn

When n is odd, there are no intersections in the interior of an n-gon where more than 2 diagonals meet.
When n is not a multiple of 6, there are no intersections in the interior of an n-gon where more than 3 diagonals meet except the center.
When n is not a multiple of 30, there are no intersections in the interior of an n-gon where more than 5 diagonals meet except the center.
I checked the following conjecture up to n=210: "An n-gon with n=30k has 5n points where 6 or 7 diagonals meet and no interior point other than the center where more than 7 diagonals meet; If k is odd, then 6 diagonals meet in each of 4n points and 7 diagonals meet in each of n points; If k is even, then no groups of exactly 6 diagonals meet in a point, while exactly 7 diagonals meet in each of 5n points (all points interior excluding the center)."

			a(18)=54 because inside a regular 18-gon there are 54 points where exactly four diagonals intersect.

Seiichi Manyama, Table of n, a(n) for n = 3..10000 (terms 3..210 from Graeme McRae)
Sequences formed by drawing all diagonals in regular polygon

A column of A292105.
Cf. A006561, A007678.
Cf. A000332: C(n, 4) = number of intersection points of diagonals of convex n-gon.
Cf. A006561: number of intersections of diagonals in the interior of regular n-gon.
Cf. A101363: number of 3-way intersections in the interior of a regular 2n-gon.
Cf. A101365: number of 5-way intersections in the interior of a regular n-gon.
Cf. A137938: number of 4-way intersections in the interior of a regular 6n-gon.
Cf. A137939: number of 5-way intersections in the interior of a regular 6n-gon.

A101365 In the interior of a regular n-gon with all diagonals drawn, the number of points where exactly five diagonals intersect.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 54, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 180, 0, 0, 0, 0, 0, 216, 0, 0, 0, 0, 0, 546, 0, 0, 0, 0, 0, 336, 0, 0, 0, 0, 0, 648, 0, 0, 0, 0, 0, 720, 0, 0, 0, 0, 0, 990, 0, 0, 0, 0, 0, 936, 0, 0, 0, 0, 0, 1404, 0, 0, 0, 0, 0, 2352, 0, 0, 0, 0, 0, 1890, 0, 0, 0, 0

Offset: 3

Graeme McRae, Dec 26 2004, revised Feb 23 2008

nonn

When n is odd, there are no intersections in the interior of an n-gon where more than 2 diagonals meet.
When n is not a multiple of 6, there are no intersections in the interior of an n-gon where more than 3 diagonals meet except the center.
When n is not a multiple of 30, there are no intersections in the interior of an n-gon where more than 5 diagonals meet except the center.
I checked the following conjecture up to n=210: "An n-gon with n=30k has 5n points where 6 or 7 diagonals meet and no interior point other than the center where more than 7 diagonals meet; If k is odd, then 6 diagonals meet in each of 4n points and 7 diagonals meet in each of n points; If k is even, then no groups of exactly 6 diagonals meet in a point, while exactly 7 diagonals meet in each of 5n points (all points interior excluding the center)."

			a(18)=54 because inside a regular 18-gon there are 54 points (3 on each radius) where exactly five diagonals intersect.

Seiichi Manyama, Table of n, a(n) for n = 3..10000 (terms 3..210 from Graeme McRae)
Sequences formed by drawing all diagonals in regular polygon

A column of A292105.
Cf. A006561, A007678.
Cf. A000332: C(n, 4) = number of intersection points of diagonals of convex n-gon.
Cf. A006561: number of intersections of diagonals in the interior of regular n-gon.
Cf. A101363: number of 3-way intersections in the interior of a regular 2n-gon.
Cf. A101364: number of 4-way intersections in the interior of a regular n-gon.
Cf. A137938: number of 4-way intersections in the interior of a regular 6n-gon.
Cf. A137939: number of 5-way intersections in the interior of a regular 6n-gon.

A217746 Number of polygonal regions with finite area in the exterior of a regular n-gon with all diagonals drawn.

Original entry on oeis.org

0, 0, 0, 0, 7, 24, 63, 120, 242, 384, 650, 896, 1425, 1872, 2703

Offset: 3

Martin Renner, Mar 23 2013

nonn

			a(7) = 7 since the 28 diagonals of the regular heptagon divide the exterior in 35 regions consisting of seven triangles (with finite area), i.e., 1 triangle (7 times), and 28 regions with infinite area of three different shapes (two 7 times, one 14 times).
a(8) = 24 since the 40 diagonals of the regular octagon divide the exterior in 64 regions consisting of 24 polygons (with finite area), i.e., 2 triangles (one 8 times, one 16 times), and 40 regions with infinite area of three different shapes (one 8 times, two 16 times).
a(9) = 63 since the 54 diagonals of the regular 9-gon (nonagon) divide the exterior in 117 regions consisting of 63 polygons (with finite area), i.e., 3 triangles (one 9 times, two 18 times) and 2 quadrilaterals (each 9 times), and 54 regions with infinite area of four different shapes (two 9 times, two 18 times).

Cf. A007678, A217745, A217748.

a(n) = A217745(n) - A217748(n)

A332953 The number of regions formed inside an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices.

Original entry on oeis.org

1, 5, 18, 52, 125, 257, 486, 832, 1333, 2027, 3048, 4304, 6057, 8167, 10749, 13929, 18058, 22664, 28533, 34981, 42519, 51425, 62118, 73473, 86768, 101902, 118695, 137138, 159147, 181752, 208813, 237209, 268614, 303718, 340882, 380811, 427540, 477134, 530047

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Mar 04 2020

nonn

The terms are from numeric computation - no formula for a(n) is currently known.
Equivalently, this is also the number of regions formed when all the integer points along the x and y axes with 0 <= x <= n and 0 <= y <= n are joined by straight line segments.
If instead one takes points on the x and y axes with coordinates 1, 1/2, 1/3, 1/4, ..., 1/n, 0, and joins them all by line segments, the resulting figure contains only triangles and quadrilaterals, and the number of regions is given by A332358 (and more generally by A332357 if there are m+1 such points on the x axis and n+1 such points on the y axis).

Lars Blomberg, Table of n, a(n) for n = 1..70
Scott R. Shannon, Illustration for n = 2.
Scott R. Shannon, Illustration for n = 3.
Scott R. Shannon, Illustration for n = 4.
Scott R. Shannon, Illustration for n = 5.
Scott R. Shannon, Illustration for n = 6.
Scott R. Shannon, Illustration for n = 8.
Scott R. Shannon, Illustration for n = 10.
Scott R. Shannon, Illustration for n = 12.
Scott R. Shannon, Illustration for n = 15.
Scott R. Shannon, Illustration for n = 5 with random distance-based coloring.
Scott R. Shannon, Illustration for n = 10 with random distance-based coloring.
Scott R. Shannon, Illustration for n = 15 with random distance-based coloring.

Cf. A333025 (n-gons), A333026 (vertices), A333027 (edges), A007678, A092867, A331452, A331911, A332357, A332358.

a(16) and beyond from Lars Blomberg, May 26 2020

A333025 Irregular table read by rows: Take an isosceles triangle with its equal length sides divided into n equal parts with all diagonals drawn, as in A332953. Then T(n,k) = number of k-sided polygons in that figure for k>=3.

Original entry on oeis.org

1, 5, 14, 3, 1, 29, 19, 4, 50, 66, 9, 81, 164, 12, 134, 313, 37, 2, 219, 546, 60, 7, 359, 853, 112, 9, 556, 1294, 160, 16, 1, 779, 1940, 283, 43, 3, 1105, 2780, 360, 53, 6, 1540, 3750, 670, 91, 5, 1, 2087, 5064, 873, 132, 11, 2806, 6625, 1144, 164, 7, 3

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Mar 05 2020

See the links in A332953 for images of the triangles.

			Table begins:
1;
5;
14, 3, 1;
29, 19, 4;
50, 66, 9;
81, 164, 12;
134, 313, 37, 2;
219, 546, 60, 7;
359, 853, 112, 9;
556, 1294, 160, 16, 1;
779, 1940, 283, 43, 3;
1105, 2780, 360, 53, 6;
1540, 3750, 670, 91, 5, 1;
2087, 5064, 873, 132, 11;
2806, 6625, 1144, 164, 7, 3;
The row sums are A332953.

Lars Blomberg, Table of n, a(n) for n = 1..613 (the first 70 rows)

Cf. A332953 (regions), A333026 (vertices), A333027 (edges), A007678, A092867, A331452, A331911, A332357, A332358.

cp's OEIS Frontend

A344866 Number of polygons formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A344938 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line, for k = 3, 4, ..., max_k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A345459 Number of polygons formed when connecting all 4n points on the perimeter of an n X n square by infinite lines.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A359046 Number of distinct regions among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A359061 Irregular table read by rows: T(n,k) is the number of k-gons formed, k>=2, among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A101364 In the interior of a regular n-gon with all diagonals drawn, the number of points where exactly four diagonals intersect.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A101365 In the interior of a regular n-gon with all diagonals drawn, the number of points where exactly five diagonals intersect.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A217746 Number of polygonal regions with finite area in the exterior of a regular n-gon with all diagonals drawn.

Views

Author

Keywords

Examples

Crossrefs

Formula

A332953 The number of regions formed inside an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A333025 Irregular table read by rows: Take an isosceles triangle with its equal length sides divided into n equal parts with all diagonals drawn, as in A332953. Then T(n,k) = number of k-sided polygons in that figure for k>=3.