A349784 -id:A349784 - cp's OEIS frontend

A351045 Irregular table read by rows: row n gives the number of edges with k facing edges for a regular n-gon with all diagonals drawn, with n>=3 and k>=2.

3, 4, 0, 4, 5, 0, 10, 0, 5, 6, 0, 18, 12, 6, 7, 0, 28, 14, 21, 14, 7, 8, 0, 56, 48, 24, 9, 0, 54, 54, 72, 72, 18, 0, 9, 10, 0, 80, 160, 120, 20, 11, 0, 88, 154, 198, 198, 55, 0, 0, 0, 11, 12, 0, 240, 336, 168, 13, 0, 130, 260, 507, 390, 91, 104, 0, 0, 0, 0, 13, 14, 0, 266, 616, 644, 140, 42

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Jan 30 2022

The number of facing edges for a given edge is the number of other edges in the one (for edges on the outside of the n-gon) or two polygons that the edge forms a part of. For example, for an edge shared between two adjoined triangles the number of facing edges is four, as it faces two edges in each of the two triangles it forms a part of.
All edges that are on the outside of the n-gon have two facing edges as any such edge belongs to only one (interior) triangle. Thus T(n,2) = n. For odd n the central created n-gon, see A342222, is surrounded by triangles, thus the edges that form this central n-gon have (n-1)+(3-1) = n+1 facing edges, thus T(n,n+1) >= n.
For all n-gons with even n, or odd n if the central n-gon is ignored, the maximum k for which row(n,k) > 0 is unknown, although it is clearly related to the maximum sided cell for all n-gons; see A349784.

			A hexagon with all diagonals drawn has six edges (those on the outside of the hexagon) which form one side of a single triangle and thus face two edges, eighteen edges that adjoin two triangles and thus face four edges, twelve edges that adjoin a triangle and a quadrilateral and thus face five edges, and six edges that adjoin two quadrilaterals and thus face six edges. Thus the row for n = 6 is [6, 0, 18, 12, 6]. See the attached image.
The table begins:
3;
4, 0, 4;
5, 0, 10, 0, 5;
6, 0, 18, 12, 6;
7, 0, 28, 14, 21, 14, 7;
8, 0, 56, 48, 24;
9, 0, 54, 54, 72, 72, 18, 0, 9;
10, 0, 80, 160, 120, 20;
11, 0, 88, 154, 198, 198, 55, 0, 0, 0, 11;
12, 0, 240, 336, 168;
13, 0, 130, 260, 507, 390, 91, 104, 0, 0, 0, 0, 13;
14, 0, 266, 616, 644, 140, 42;
15, 0, 180, 600, 945, 630, 435, 0, 15, 0, 0, 0, 0, 0, 15;
16, 0, 448, 1056, 960, 576, 32;
17, 0, 238, 816, 1853, 1224, 425, 272, 34, 0, 0, 0, 0, 0, 0, 0, 17;
18, 0, 900, 1836, 1314, 108, 144;
19, 0, 304, 1520, 2717, 2128, 798, 304, 95, 0, 19, 0, 0, 0, 0, 0, 0, 0, 19;
20, 0, 1000, 2120, 3280, 1600, 100, 240;
21, 0, 378, 2352, 4494, 3276, 1365, 252, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21;
22, 0, 1056, 3828, 5258, 1716, 374, 396, 132;
.
.
See the linked file for the table n = 3..100.

Scott R. Shannon, Table for n = 3..100.
Scott R. Shannon, Image of the edges for n = 6.
Scott R. Shannon, Image of the edges for n = 9.
Scott R. Shannon, Image of the edges for n = 15.
Scott R. Shannon, Image of the edges for n = 25.
Scott R. Shannon, Image of the edges for n = 30.

Cf. A135565, A342222, A349784, A344899, A342236, A342222, A342236.

Sum of row n = A135565(n).
T(n,2) = n.
T(n,n+1) >= n for odd n.

A351129 Number of regions in a regular n-gon with all diagonals drawn whose edges all have the same number of facing edges.

Original entry on oeis.org

1, 0, 1, 0, 1, 8, 1, 0, 1, 132, 66, 56, 46, 144, 171, 576, 305, 620, 652, 616, 852, 1296, 1376, 1482, 1891, 1820, 2379, 4530, 3163, 3328, 3532, 4046, 4656, 4896, 6661, 6460, 7411, 7560, 9595, 11676, 10923, 13552, 10936, 13294, 14806, 17232, 17935, 17200, 20452, 20540, 24964, 27270

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Feb 02 2022

nonn

See A351045 for details of an edge's count of facing edges in an n-gon with all diagonals drawn.

			a(5) = 1. A pentagon with all diagonals drawn contains a central pentagon which is surrounded by five other triangles and therefore all its edges have a facing edge count of 6. See the attached image.
a(8) = 8. An octagon with all diagonals drawn contains eight central triangles all of which are surrounded by three other triangles and therefore all their edges have a facing edge count of 4. See the attached image.
a(15) = 46. A 15-gon with all diagonals drawn contains one central 15-gon which is surrounded by triangles, thirty quadrilaterals which are surrounded by other quadrilaterals, and fifteen triangles which are surrounded by pentagons. This gives a total of forty-six regions whose edges all have the same facing edge count. See the attached image.

Scott R. Shannon, Table of n, a(n) for n = 3..100
Scott R. Shannon, Image for n = 5. In this and other images the regions with edges with the same facing edge count are highlighted in the corresponding edge color.
Scott R. Shannon, Image for n = 8.
Scott R. Shannon, Image for n = 12.
Scott R. Shannon, Image for n = 15.
Scott R. Shannon, Image for n = 18.
Scott R. Shannon, Image for n = 24.

Cf. A351045, A135565, A007678, A342222, A349784, A344899, A342236.

A350718 Number of regions in a regular n-gon with all diagonals drawn whose edges all have a different number of facing edges.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 44, 0, 130, 84, 180, 128, 374, 180, 418, 440, 714, 704, 1104, 624, 1750, 1976, 2484, 2744, 3190, 2880, 3658, 4416, 5280, 6188, 7000, 7128, 8214, 8892, 10296, 10560, 13120, 14028, 16082, 15928, 22140, 20332, 22466, 26112, 27538, 29200, 36924, 36504, 35934, 40284, 41140

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Feb 03 2022

nonn

See A351045 for details of an edge's count of facing edges in an n-gon with all diagonals drawn.

For n = 3 to n = 80 the regions with edges all with a different number of facing edges are all triangles or quadrilaterals. The 81-gon is the first n-gon to contain pentagons with this property. The largest number of edges possible for such regions is unknown.

			a(11) = 44. The 11-gon contains forty-four triangles whose three edges all have a different number of facing edges. This is the first n-gon to contain such regions. See the attached image.

Scott R. Shannon, Table of n, a(n) for n = 3..140
Scott R. Shannon, Image for n = 11. This is the first n-gon to contain regions whose edges all have a different facing edge count. In this and other images such regions are highlighted in gray.
Scott R. Shannon, Image for n = 13.
Scott R. Shannon, Image for n = 18.
Scott R. Shannon, Image for n = 81. This is zoomed-in on one of the pentagons whose edges all have a different facing edge count: 6,7,8,9,10.

Cf. A351045, A351129, A135565, A007678, A342222, A349784.

A354133 Irregular table read by rows: for each interior cell of a regular n-gon with all diagonals drawn remove all its edges and then count the number of sides in the resulting polygon; row n gives the number of resulting k-sided polygons, for k >= 6, for all interior cells.

Original entry on oeis.org

0, 0, 0, 0, 5, 0, 1, 0, 12, 0, 0, 6, 0, 14, 7, 0, 0, 0, 14, 0, 8, 8, 32, 8, 0, 24, 0, 36, 9, 0, 9, 0, 18, 36, 36, 0, 0, 0, 1, 0, 60, 20, 0, 100, 0, 30, 0, 66, 11, 0, 33, 0, 143, 0, 66, 22, 22, 0, 0, 0, 0, 0, 1, 48, 144, 48, 72, 60, 48, 12, 0, 104, 13, 0, 39, 52, 208, 78, 156, 26, 78, 0, 13, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 3

Scott R. Shannon, May 18 2022

An interior cell is one that has no edges that form the outside of the n-gon, i.e., all of its edges are shared with another cell. The number of such cells is A007678(n) - n = A191101(n).
The minimum number of sides in the created k-gons is 6 - this corresponds to a triangle that is adjoined to three other triangles. Only n-gons with an even number of sides can contain these triangles as their vertices must be formed by the intersection of three or more diagonals; only even-sided polygons contain such vertices.
Numerous patterns appear in the terms. For odd n >= 13 there is always one 2n-sided polygon which is created by the central n-sided polygon being surrounded by n triangles, thus row(n,2n) = 1. These n triangles themselves are adjoined to the central n-gon and two 4-gons so they create an n-1 + 3 + 3 = (n+5)-sided polygon, thus row(n,n+5) = n.
Almost all even-n n-gons contain triangles surrounded by three other triangles and therefore have values for k=6. The exceptions for n >= 6 up to the 140-gon are n=6,10,14,22,26,46,50,58,70. It is plausible that the 70-gon is the last even-n polygon not to contain such triangles.
Ignoring the central n-gon and its surrounding triangles for odd-sided n-gons, the largest possible created k-gon is unknown. It is likely related to the maximum number of sides of any cell, see A349784, which is also unknown. For n <= 140 the largest created k-gon is a 34-gon which surrounds a 14-sided cell in the 132-gon. See the linked image.
Up to the 36-gon the most commonly created k-sided polygon is shared between k values of 8 to 13 inclusive. The 36-gon has the 11-gon as the most commonly created, but from the 37-gon up to at least the 140-gon the 12-gon becomes the most common. The distribution of k-gons for the larger n values becomes quite uniform and it is therefore possible that the 12-gon is the most commonly created polygon for all n-gons for n >= 37.

			The 8-gon contains eight triangles that adjoin three triangles and thus create a 6-gon, thirty-two triangles that adjoin two triangles and one quadrilateral and thus create a 7-gon, eight triangles that adjoin one triangle and two quadrilaterals and thus create an 8-gon, and twenty-four quadrilaterals that adjoin two triangles and two quadrilaterals and thus create a 10-gon. Therefore row 8 is [8,32,8,0,24].
The table begins:
0;
0;
0, 0, 5, 0, 1;
0, 12, 0, 0, 6;
0, 14, 7, 0, 0, 0, 14, 0, 8;
8, 32, 8, 0, 24;
0, 36, 9, 0, 9, 0, 18, 36, 36, 0, 0, 0, 1;
0, 60, 20, 0, 100, 0, 30;
0, 66, 11, 0, 33, 0, 143, 0, 66, 22, 22, 0, 0, 0, 0, 0, 1;
48, 144, 48, 72, 60, 48, 12;
0, 104, 13, 0, 39, 52, 208, 78, 156, 26, 78, 0, 13, 0, 0, 0, 0, 0, 0, 0, 1;
0, 140, 126, 140, 196, 112, 140, 28, 56;
0, 150, 15, 0, 60, 180, 465, 150, 210, 60, 135, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0, \
                                                                       0, 0, 0, 1;
32, 256, 144, 192, 240, 352, 240, 160, 32, 0, 32;
.
See the linked file for the table n = 3..120.

Scott R. Shannon, Table for n = 3..120.
Scott R. Shannon, Image for the 8-gon. In this and other images the color of the interior cells is based on the number of edges in the surrounding k-gon given in the key.
Scott R. Shannon, Image for the 11-gon.
Scott R. Shannon, Image for the 12-gon.
Scott R. Shannon, Image for the 17-gon.
Scott R. Shannon, Image for the 18-gon.
Scott R. Shannon, Image for the 26-gon. This is one of the few even-sided n-gons that does not contain triangles adjoined to three other triangles.
Scott R. Shannon, Image for the 36-gon.
Scott R. Shannon, Image showing a close-up of a 14-sided cell in the 132-gon. This creates a 34-sided k-gon.

Cf. A007678, A191101, A349784, A353876, A007569, A135565, A351045.

cp's OEIS Frontend

A351045 Irregular table read by rows: row n gives the number of edges with k facing edges for a regular n-gon with all diagonals drawn, with n>=3 and k>=2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A351129 Number of regions in a regular n-gon with all diagonals drawn whose edges all have the same number of facing edges.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A350718 Number of regions in a regular n-gon with all diagonals drawn whose edges all have a different number of facing edges.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A354133 Irregular table read by rows: for each interior cell of a regular n-gon with all diagonals drawn remove all its edges and then count the number of sides in the resulting polygon; row n gives the number of resulting k-sided polygons, for k >= 6, for all interior cells.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs