A331451 -id:A331451 - cp's OEIS frontend

A007678 Number of regions in regular n-gon with all diagonals drawn.

0, 0, 1, 4, 11, 24, 50, 80, 154, 220, 375, 444, 781, 952, 1456, 1696, 2500, 2466, 4029, 4500, 6175, 6820, 9086, 9024, 12926, 13988, 17875, 19180, 24129, 21480, 31900, 33856, 41416, 43792, 52921, 52956, 66675, 69996, 82954, 86800, 102050, 97734, 124271, 129404, 149941

Offset: 1

N. J. A. Sloane, Bjorn Poonen (poonen(AT)math.princeton.edu)

This sequence and A006533 are two equivalent ways of presenting the same sequence.
A quasipolynomial of order 2520. - Charles R Greathouse IV, Jan 15 2013
Also the circuit rank of the n-polygon diagonal intersection graph. - Eric W. Weisstein, Mar 08 2018
This sequence only counts polygons, in contrast to A006533 which also counts the n segments of the circumscribed circle delimited by the edges of the regular n-gon. Therefore a(n) = A006533(n) - n. See also A006561 which counts the intersection points, and A350000 which considers iterated "cutting along diagonals". - M. F. Hasler, Dec 13 2021
The Petrie polygon orthographic projection of a regular n-simplex is a regular (n+1)-gon with all diagonals drawn. Hence a(n+1) is the number of regions in the Petrie polygon of a regular n-simplex. - Mohammed Yaseen, Nov 05 2022

Jean Meeus, Wiskunde Post (Belgium), Vol. 10, 1972, pp. 62-63.
C. A. Pickover, The Mathematics of Oz, Problem 58 "The Beauty of Polygon Slicing", Cambridge University Press, 2002.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
Lars Blomberg, Scott R. Shannon, and N. J. A. Sloane, Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids, (2020). Also arXiv:2009.07918.
Robert Dougherty-Bliss, First draft of Python program to produce colored drawings of these figures, Github, Feb 09 2020.
Martin Griffiths, Counting the regions in a regular drawing of K_{n,n}, J. Int. Seq. 13 (2010) # 10.8.5.
M. F. Hasler, Interactive illustration of A006561(n) & A006533(n); colored version for n=6 and for n=8.
Sascha Kurz, m-gons in regular n-gons (in German).
J. Meeus & N. J. A. Sloane, Correspondence, 1974-1975
Bjorn Poonen and Michael Rubinstein, The Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics 11, no. 1 (1998), pp. 135-156; DOI:10.1137/S0895480195281246. [Author's copy]. The latest arXiv version arXiv:math/9508209 has corrected some typos in the published version.
Bjorn Poonen and Michael Rubinstein, Mathematica programs for these sequences
J. F. Rigby, Multiple intersections of diagonals of regular polygons, and related topics, Geom. Dedicata 9 (1980), 207-238.
M. Rubinstein, Drawings for n=4,5,6,...
Scott R. Shannon, Colored illustration for n = 17
Scott R. Shannon, Colored illustration for n = 18
Scott R. Shannon, Colored illustration for n = 19
Scott R. Shannon, Colored illustration for n = 23
Scott R. Shannon, Colored illustration for n = 27
Scott R. Shannon, Colored illustration for n = 40
Scott R. Shannon, Colored illustration for n = 41 (1st version)
Scott R. Shannon, Colored illustration for n = 41 (2nd version)
Scott R. Shannon, Colored illustration for n = 41 (3rd version). This variation has coloring based on the number of edges of the polygon: red = 3-gon, orange = 4-gon, yellow = 5-gon, light-green = 6-gon etc.
N. J. A. Sloane (in collaboration with Scott R. Shannon), Art and Sequences, Slides of guest lecture in Math 640, Rutgers Univ., Feb 8, 2020. Mentions this sequence.
N. J. A. Sloane, "A Handbook of Integer Sequences" Fifty Years Later, arXiv:2301.03149 [math.NT], 2023, p. 18.
N. J. A. Sloane, Summary table for vertices and regions in regular n-gon with all chords drawn, for n = 3..19. [V = total number of vertices (A007569), V_i (i>=2) = number of vertices where i lines cross (A292105, A292104, A101363); R = total number of cells or regions (A007678), R_i (i>=3) = number of regions with i edges (A331450, A062361, A067151).]
Prasad Balakrishnan Warrier, The physiognomy of the Erdős-Szekeres conjecture (happy ending problem), Math. Student (Indian Math. Soc., 2024) Vol. 93, Nos. 3-4, 28-48.
Eric Weisstein's World of Mathematics, Circuit Rank
Eric Weisstein's World of Mathematics, Polygon Diagonal Intersection Graph
Eric Weisstein's World of Mathematics, Regular Polygon Division by Diagonals
Sequences formed by drawing all diagonals in regular polygon
Sequences related to chord diagrams

Cf. A001006, A054726, A006533, A006561, A006600, A007569 (number of vertices), A006522, A135565 (number of line segments).
A062361 gives number of triangles, A331450 and A331451 give distribution of polygons by number of sides.
A333654, A335614, A335646, A337330 give the number of internal n-gon to k-gon contacts for n>=3, k>=n.
A187781 gives number of distinct regions.

del[m_,n_]:=If[Mod[n,m]==0,1,0]; R[n_]:=If[n<3, 0, (n^4-6n^3+23n^2-42n+24)/24 + del[2,n](-5n^3+42n^2-40n-48)/48 - del[4,n](3n/4) + del[6,n](-53n^2+310n)/12 + del[12,n](49n/2) + del[18,n]*32n + del[24,n]*19n - del[30,n]*36n - del[42,n]*50n - del[60,n]*190n - del[84,n]*78n - del[90,n]*48n - del[120,n]*78n - del[210,n]*48n]; Table[R[n], {n,1,1000}] (* T. D. Noe, Dec 21 2006 *)

/* Only for odd n > 3, not suitable for other values of n! */ { a(n)=local(nr,x,fn,cn,fn2); nr=0; fn=floor(n/2); cn=ceil(n/2); fn2=(fn-1)^2-1; nr=fn2*n+fn+(n-2)*fn+cn; x=(n-5)/2; if (x>0,nr+=x*(x+1)*(2*x+1)/6*n); nr; } \\ Jon Perry, Jul 08 2003

apply( {A007678(n)=if(n%2, (((n-6)*n+23)*n-42)*n/24+1, ((n^3/2 -17*n^2/4 +22*n -if(n%4, 31, 40) +!(n%6)*(310 -53*n))/12 +!(n%12)*49/2 +!(n%18)*32 +!(n%24)*19 -!(n%30)*36 -!(n%42)*50 -!(n%60)*190 -!(n%84)*78 -!(n%90)*48 -!(n%120)*78 -!(n%210)*48)*n)}, [1..44]) \\ M. F. Hasler, Aug 06 2021

def d(n,m): return not n % m
def A007678(n): return (1176*d(n,12)*n - 3744*d(n,120)*n + 1536*d(n,18)*n - d(n,2)*(5*n**3 - 42*n**2 + 40*n + 48) - 2304*d(n,210)*n + 912*d(n,24)*n - 1728*d(n,30)*n - 36*d(n,4)*n - 2400*d(n,42)*n - 4*d(n,6)*n*(53*n - 310) - 9120*d(n,60)*n - 3744*d(n,84)*n - 2304*d(n,90)*n + 2*n**4 - 12*n**3 + 46*n**2 - 84*n)//48 + 1 # Chai Wah Wu, Mar 08 2021

For odd n > 3, a(n) = sumstep {i=5, n, 2, (i-2)*floor(n/2)+(i-4)*ceiling(n/2)+1} + x*(x+1)*(2*x+1)/6*n), where x = (n-5)/2. Simplifying the floor/ceiling components gives the PARI code below. - Jon Perry, Jul 08 2003
For odd n, a(n) = (24 - 42*n + 23*n^2 - 6*n^3 + n^4)/24. - Graeme McRae, Dec 24 2004
a(n) = A006533(n) - n. - T. D. Noe, Dec 23 2006
For odd n, binomial transform of [1, 10, 29, 36, 16, 0, 0, 0, ...] = [1, 11, 50, 154, ...]. - Gary W. Adamson, Aug 02 2011
a(n) = A135565(n) - A007569(n) + 1. - Max Alekseyev
See the Mma code in A006533 for the explicit Poonen-Rubenstein formula that holds for all n. - N. J. A. Sloane, Jan 23 2020

More terms from Graeme McRae, Dec 26 2004

a(1) = a(2) = 0 prepended by Max Alekseyev, Dec 01 2011

A331450 Irregular triangle read by rows: Take a regular n-sided polygon (n>=3) with all diagonals drawn, as in A007678. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., max_k.

Original entry on oeis.org

1, 4, 10, 0, 1, 18, 6, 35, 7, 7, 0, 1, 56, 24, 90, 36, 18, 9, 0, 0, 1, 120, 90, 10, 176, 132, 44, 22, 276, 168, 377, 234, 117, 39, 0, 13, 0, 0, 0, 0, 1, 476, 378, 98, 585, 600, 150, 105, 15, 0, 0, 0, 0, 0, 0, 0, 1, 848, 672, 128, 48, 1054, 901, 357, 136, 17, 34, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1404, 954, 72, 18, 18, 1653, 1444, 646, 190, 57, 38, 2200, 1580, 580, 120, 0, 20, 2268, 2520, 903, 462, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Jan 25 2020

Computed by Scott R. Shannon, Jan 24 2020
See A331451 for a version of this triangle giving the counts for k = 3 through n.
Mitosis of convex polygons, by Scott R. Shannon and N. J. A. Sloane, Dec 13 2021 (Start)
Borrowing a term from biology, we can think of this process as the "mitosis" of a regular polygon. Row 6 of this triangle shows that a regular hexagon "mitoses" into 18 triangles and 4 quadrilaterals, which we denote by 3^18 4^6.
What if we start with a convex but not necessarily regular n-gon? Let M(n) denote the number of different decompositions into cells that can be obtained. For n = 3, 4, and 5 there is only one possibility. For n = 6 there are two possibilities, 3^18 4^6 and 3^19 4^3 5^3. For n = 7 there are at least 11 possibilities. So the sequence M(n) for n >= 3 begins 1, 1, 1, 2, >=11, ...
The links below give further information. See also A350000. (End)

			A hexagon with all diagonals drawn contains 18 triangles and 6 quadrilaterals, so row 6 is [18, 6].
Triangle begins:
  1,
  4,
  10, 0, 1,
  18, 6,
  35, 7, 7, 0, 1,
  56, 24,
  90, 36, 18, 9, 0, 0, 1,
  120, 90, 10,
  176, 132, 44, 22, 0, 0, 0, 0, 1
  276, 168,
  377, 234, 117, 39, 0, 13, 0, 0, 0, 0, 1,
  476, 378, 98,
  585, 600, 150, 105, 15, 0, 0, 0, 0, 0, 0, 0, 1,
  848, 672, 128, 48,
  1054, 901, 357, 136, 17, 34, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  1404, 954, 72, 18, 18,
  1653, 1444, 646, 190, 57, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
  2200, 1580, 580, 120, 0, 20,
  2268, 2520, 903, 462, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  2992, 2860, 814, 66, 44, 44,
  3749, 2990, 1564, 644, 115, 23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  ...
The row sums are A007678, the first column is A062361.

M. Rubinstein, Drawings of A007678 for n=4,5,6,....
Scott R. Shannon, Rows 3 through 596 of A331450.
N. J. A. Sloane, Illustration for row n=9 of A331450. [9-gon with one representative for each type of polygonal cell labeled with its number of sides].
N. J. A. Sloane, Summary table for vertices and regions in regular n-gon with all chords drawn, for n = 3..19. [V = total number of vertices (A007569), V_i (i>=2) = number of vertices where i lines cross (A292105, A292104, A101363); R = total number of cells or regions (A007678), R_i (i>=3) = number of regions with i edges (A331450, A062361, A067151).]
Scott R. Shannon and N. J. A. Sloane, N. J. A. Sloane, Table showing number of ways to "mitose" a convex n-gon. [From here on the links are related to the mitosis problem, and are in logical rather than alphabetical order]
Scott R. Shannon, Illustration for mitosis 5.1 of a pentagon (the cell counts are the same whether of not the pentagon is regular)
Scott R. Shannon, Illustration for mitosis 6.1 of a hexagon with a triple point (the cell counts are the same whether of not the hexagon is regular, as long as it has a triple point)
Scott R. Shannon, Illustration for mitosis 6.2 of a hexagon (without a triple point)
N. J. A. Sloane, Illustration for mitosis 7a of a 7-gon
Scott R. Shannon, A second (colored) illustration for mitosis 7a of a 7-gon
Scott R. Shannon, Illustration for mitosis 7b
Scott R. Shannon, Illustration for mitosis 7c
Scott R. Shannon, Illustration for mitosis 7d
Scott R. Shannon, Illustration for mitosis 7e
Scott R. Shannon, Illustration for mitosis 7f
Scott R. Shannon, Illustration for mitosis 7g
Scott R. Shannon, Illustration 1 for mitosis 7h
Scott R. Shannon, Illustration 2 for mitosis 7h (same cell counts as preceding illustration but a different polygon - look at the brown cells)
Scott R. Shannon, Illustration for mitosis 7i
Scott R. Shannon, Illustration for mitosis 7j
Scott R. Shannon, Illustration for mitosis 7k
M. F. Hasler, Nine examples of dissections of convex 7-gons [These are all subsumed in the above illustrations]

Cf. A007678, A062361, A331451, A341729, A341730, A335000.

Added "regular" to definition. - N. J. A. Sloane, Mar 06 2021

A342222 a(n) is the smallest m such that a regular m-gon with all diagonals drawn contains a cell with n sides, or a(n) = -1 if no such m exists.

Original entry on oeis.org

3, 6, 5, 9, 7, 13, 9, 29, 11, 40, 13, 43, 15, 212, 17, 231, 19

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Mar 06 2021

Theorem: If n is odd then a(n) = n.
Proof. (i) If n is odd then the central cell in a regular n-gon with all diagonals drawn is a smaller regular n-gon. So if n is odd, then a(n) <= n.
(ii) Suppose a convex m-gon, not necessarily regular, with all diagonals drawn has a cell with e edges. Each edge when extended meets two vertices, so at most 2e vertices are involved in defining the boundary of that cell.
On the other hand no vertex can define more than two edges of the cell, so 2e <= 2m, so e <= m. So to get an n-sided cell, we need at least n vertices. So a(n) >= n. QED.
If a(20) > 0 it is greater than 765 - Scott R. Shannon, Nov 30 2021

			Examining the images in A007678, for example Michael Rubinstein's illustration, or the images shown here, we see that the first occurrence of a five-sided cell is for m = 5, so a(5) = 5. The first time we see a four-sided cell is for m = 6, so a(4) = 6.

Martin Balko, Anna Brötzner, Fabian Klute, and Josef Tkadlec, Faces in Rectilinear Drawings of Complete Graphs, 40th European Workshop on Computational Geometry, Ioannina, Greece, March 13-15, 2024. See pp. 4, 7.
Scott R. Shannon, Image for a(3) = 3.
Scott R. Shannon, Image for a(4) = 6.
Scott R. Shannon, Image for a(5) = 5.
Scott R. Shannon, Image for a(6) = a(9) = 9.
Scott R. Shannon, Image for a(7) = 7.
Scott R. Shannon, Image for a(8) = a(13) = 13.
Scott R. Shannon, Image for a(10) = 29.
Scott R. Shannon, Image for a(11) = 11.
Scott R. Shannon, Image for a(12) = 40.
Scott R. Shannon, Image for a(14) = 43.
Scott R. Shannon, Image for a(15) = 15.

Cf. A007678, A331450, A331451, A007569, A135565.

See also A341729 and A341730 for the maximum number of sides in any cell.

a(16)-a(19) added by Scott R. Shannon, Mar 14 2021

A359009 Irregular table read by rows: T(n,k) is the number of k-gons formed, k>=2, when every pair of n points, placed at the vertices of a regular n-gon, are connected by a circle and where the points lie at the ends of the circle's diameter.

Original entry on oeis.org

1, 0, 7, 8, 4, 0, 40, 20, 6, 6, 72, 6, 0, 0, 0, 0, 0, 0, 0, 1, 0, 133, 98, 42, 7, 1, 16, 184, 56, 0, 8, 0, 342, 306, 99, 54, 0, 0, 1, 10, 510, 220, 60, 10, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 693, 858, 231, 88, 11, 11, 0, 0, 1, 24, 924, 612, 120, 60, 0, 1469, 1560, 455, 299, 13, 0, 0, 13, 0, 0, 1

Offset: 2

Scott R. Shannon, Dec 12 2022

Conjectures: for odd values of n all vertices are simple, other than those defining the diameters of the circles. For n > 2 and (n-2) mod 4 = 0, T(n,2) = n. For n mod 4 = 0, T(n,2) = k*n, k>=2. For odd n, T(n,2) = 0.
See A358782 for more images of the k-gons.
The author thanks Zach Shannon some of whose code was used in the generation of this sequence.

			The table begins:
1;
0, 7;
8, 4;
0, 40, 20, 6;
6, 72, 6, 0, 0, 0, 0, 0, 0, 0, 1;
0, 133, 98, 42, 7, 1;
16, 184, 56, 0, 8;
0, 342, 306, 99, 54, 0, 0, 1;
10, 510, 220, 60, 10, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 693, 858, 231, 88, 11, 11, 0, 0, 1;
24, 924, 612, 120, 60;
0, 1469, 1560, 455, 299, 13, 0, 0, 13, 0, 0, 1;
14, 1806, 1428, 350, 98, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \\
                0, 0, 0, 1;
0, 2550, 2910, 870, 405, 75, 60, 0, 0, 0, 0, 0, 0, 1;
32, 3280, 2000, 768, 352, 0, 16;
0, 4301, 4862, 1734, 680, 102, 34, 0, 17, 0, 17, 0, 0, 0, 0, 1;
18, 4878, 4482, 1332, 324, 54, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \\
                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 6517, 7847, 2565, 1045, 190, 133, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
80, 7340, 7040, 1920, 700, 0, 80;
0, 9723, 11487, 4515, 1491, 210, 168, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
.
.

Scott R. Shannon, Image for n = 13.
Scott R. Shannon, Image for n = 21.

Cf. A358782 (regions), A358746 (vertices), A358783 (edges), A331451, A344938.

Sum of row n = A358782(n).

A331911 Triangle read by rows: Take an equilateral triangle with all diagonals drawn, as in A092867. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+2 and where n is the number of equal parts each side is divided into.

Original entry on oeis.org

1, 12, 0, 48, 24, 3, 162, 90, 0, 0, 378, 306, 15, 16, 0, 774, 696, 84, 18, 0, 0, 1470, 1383, 219, 37, 0, 0, 0, 2604, 2382, 600, 78, 6, 6, 0, 0, 4224, 4089, 771, 177, 24, 6, 0, 0, 0, 6624, 6186, 1470, 234, 42, 0, 0, 0, 0, 0, 9738, 9486, 2307, 498, 48, 0, 0, 3, 0, 1, 0, 14010, 13548, 3984, 816, 144, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Feb 01 2020

			An equilateral triangle with no other point along its edges, n = 1, contains 1 triangle so the first row is [1]. An equilateral triangle with 1 point dividing its edges, n = 2, contains 12 triangles and no other n-gons, so the second row is [12,0]. An equilateral triangle with 2 points dividing its edges, n = 3, contains 48 triangles, 24 quadrilaterals and 3 pentagons, so the third row is [48,24,3].
Triangle begins:
1
12,0
48,24,3
162,90,0,0
378,306,15,16,0
774,696,84,18,0,0
1470,1383,219,37,0,0,0
2604,2382,600,78,6,6,0,0
4224,4089,771,177,24,6,0,0,0
6624,6186,1470,234,42,0,0,0,0,0
9738,9486,2307,498,48,0,0,3,0,1,0
14010,13548,3984,816,144,0,0,0,0,0,0,0
19248,19224,5007,1102,156,18,0,0,0,0,0,0,0
26208,26142,8634,1668,192,24,0,0,0,0,0,0,0,0
The row sums are A092867.

Hugo Pfoertner, Intersections of diagonals in polygons of triangular shape.
Scott R. Shannon, Triangle regions for n = 2.
Scott R. Shannon, Triangle regions for n = 3.
Scott R. Shannon, Triangle regions for n = 4.
Scott R. Shannon, Triangle regions for n = 5.
Scott R. Shannon, Triangle regions for n = 6.
Scott R. Shannon, Triangle regions for n = 7.
Scott R. Shannon, Triangle regions for n = 8.
Scott R. Shannon, Triangle regions for n = 9.
Scott R. Shannon, Triangle regions for n = 10.
Scott R. Shannon, Triangle regions for n = 11.
Scott R. Shannon, Triangle regions for n = 12.
Scott R. Shannon, Triangle regions for n = 13.
Scott R. Shannon, Triangle regions for n = 14.
Scott R. Shannon, Triangle regions for n = 9, random distance-based coloring.
Scott R. Shannon, Triangle regions for n = 12, random distance-based coloring

Cf. A092867, A092866, A092866, A274586, A331451, A331452, A331907, A331909

A341729 Maximum number of sides in any cell in a regular n-gon with all diagonals drawn (cf. A007678).

Original entry on oeis.org

3, 3, 5, 4, 7, 4, 9, 5, 11, 4, 13, 5, 15, 6, 17, 7, 19, 8, 21, 8, 23, 6, 25, 8, 27, 8, 29, 6, 31, 7, 33, 8, 35, 8, 37, 8, 39, 12, 41, 8, 43, 10, 45, 8, 47, 10, 49, 10, 51, 8, 53, 10, 55, 10, 57, 10, 59, 9, 61, 10, 63, 10, 65, 9, 67, 10, 69, 10, 71, 10, 73, 10, 75, 12, 77, 10, 79, 10

Offset: 3

Scott R. Shannon and N. J. A. Sloane, Mar 06 2021

nonn

For a(2*n) see A341730.
Theorem: a(2*n+1) = 2*n+1. For the proof see A342222.
It would be nice to have a bigger b-file.

Scott R. Shannon, Table of n, a(n) for n = 3..765

Cf. A007678, A062361, A288177, A331450, A331451, A342222.

Bisections: A144396, A341730.

a(141) and beyond from Scott R. Shannon, Nov 30 2021

A333654 Irregular table read by rows: row n gives the number of 3-gon to k-gon contacts, with k>=3, for a regular n-gon with all diagonals drawn.

Original entry on oeis.org

0, 4, 10, 0, 5, 18, 12, 28, 14, 21, 0, 7, 56, 48, 54, 54, 54, 36, 0, 0, 9, 180, 160, 30, 88, 154, 88, 88, 0, 0, 0, 0, 11, 240, 336, 130, 260, 299, 182, 0, 104, 0, 0, 0, 0, 13, 266, 616, 266, 180, 600, 375, 300, 90, 0, 0, 0, 0, 0, 0, 0, 15, 448, 1056, 320, 256

Offset: 3

Scott R. Shannon, Aug 23 2020

See A335614 for the number of 4-gon to k-gon contacts, with k>=4.
See A335646 for the number of 5-gon to k-gon contacts, with k>=5.
See A337330 for the number of 6-gon to k-gon contacts, with k>=6.
See A007678 for the number of regions and images of other n-gons.

			The table begins:
.
0;
4;
10,0,5;
18,12;
28,14,21,0,7;
56,48;
54,54,54,36,0,0,9;
180,160,30;
88,154,88,88,0,0,0,0,11;
240,336;
130,260,299,182,0,104,0,0,0,0,13;
266,616,266;
180,600,375,300,90,0,0,0,0,0,0,0,15;
448,1056,320,256;
238,816,935,578,85,238,0,0,0,0,0,0,0,0,17;
900,1836,324,108,126;
304,1520,1463,798,304,228,0,0,0,0,0,0,0,0,0,0,19;
1000,2120,1740,560,0,160;
378,2352,2016,1554,84,0,0,0,0,0,0,0,0,0,0,0,0,0,21;
1056,3828,2310,308,176,220;
460,2852,4117,2530,644,138,0,0,0,0,0,0,0,0,0,0,0,0,0,0,23;
2352,5856,2376,288;
550,4550,4800,3350,900,250,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,25;
1950,6708,5772,1612,650,208;
648,6372,6399,4968,432,810,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27;
2380,10024,5712,3584,616,224;
754,8642,8497,6148,783,928,0,870,232,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29;
6330,14640,5340,2340;
868,11532,11191,7378,806,1302,0,496,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31;
3712,16384,12000,6016,1248;
990,14454,14619,12540,2079,1782,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33;

Scott R. Shannon, Image for n=4 with edge-count coloring. This is the first n-gon with 3-gon to 3-gon contacts.
Scott R. Shannon, Image for n=6 with edge-count coloring. This is the first n-gon with 3-gon to 4-gon contacts.
Scott R. Shannon, Image for n=7 with edge-count coloring. This is the first n-gon with 3-gon to 5-gon contacts, other than n=5 which has an internal 5-gon surrounded by 3-gons by its construction.
Scott R. Shannon, Image for n=9 with edge-count coloring. This is the first n-gon with 3-gon to 6-gon contacts.
Scott R. Shannon, Image for n=15 with edge-count coloring. This is the first n-gon with 3-gon to 7-gon contacts, other than n=7 which has an internal 7-gon surrounded by 3-gons by its construction.
Scott R. Shannon, Image for n=15 with random distance-based coloring.
Scott R. Shannon, Image for n=13 with edge-count coloring. This is the first n-gon with 3-gon to 8-gon contacts.
Scott R. Shannon, Image for n=29 with edge-count coloring. This is the first n-gon with 3-gon to 10-gon and 3-gon to 11-gon contacts.

Cf. A335614 (4-gon contacts), A335646 (5-gon contacts), A337330 (6-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

For odd n, with n > 3, row(n,n) = n as the n-gon contains a smaller n-gon at its center surrounded by 3-gons.

A335614 Irregular table read by rows: row n gives the number of 4-gon to k-gon contacts, with k>=4, for a regular n-gon with all diagonals drawn.

Original entry on oeis.org

0, 0, 0, 6, 0, 5, 24, 18, 36, 18, 90, 20, 110, 110, 44, 168, 208, 208, 52, 378, 140, 570, 330, 330, 640, 320, 32, 918, 646, 238, 34, 34, 990, 1254, 1330, 304, 38, 76, 1540, 1040, 80, 2478, 1722, 1008, 42, 2948, 1408, 44, 132, 132, 2852, 2254, 1012, 92, 46, 3624, 1536, 144

Offset: 3

Scott R. Shannon, Aug 23 2020

See A333654 for the number of 3-gon to k-gon contacts, with k>=3.
See A335646 for the number of 5-gon to k-gon contacts, with k>=5.
See A337330 for the number of 6-gon to k-gon contacts, with k>=6.
See A007678 for the number of regions and images of other n-gons.

			The table begins:
.
0;
0;
0;
6;
0,5;
24;
18,36,18;
90,20;
110,110,44;
168;
208,208,52;
378,140;
570,330,330;
640,320,32;
918,646,238,34,34;
990;
1254,1330,304,38,76;
1540,1040,80;
2478,1722,1008,42;
2948,1408,44,132,132;
2852,2254,1012,92,46;
3624,1536,144;
4650,3600,1450,150,150;
4784,3380,572,52;
6696,4968,2160,54,54;
7280,3752,2072,168;
8990,7308,3016,0,232,0,0,58;
7770,1200,300;
13020,9920,3472,186,434,0,124;
12160,8576,2048,256;
14784,11418,5742,792,330;

Scott R. Shannon, Image for n=6 with edge-number coloring. This is the first n-gon with 4-gon to 4-gon contacts.
Scott R. Shannon, Image for n=7 with edge-number coloring. This is the first n-gon with 4-gon to 5-gon contacts.
Scott R. Shannon, Image for n=9 with edge-number coloring. This is the first n-gon with 4-gon to 6-gon contacts.
Scott R. Shannon, Image for n=17 with edge-number coloring. This is the first n-gon with 4-gon to 7-gon and 4-gon to 8-gon contacts.
Scott R. Shannon, Image for n=31 with edge-number coloring. This is the first n-gon with 4-gon to 10-gon contacts.
Scott R. Shannon, Image for n=31 with random distance-based coloring.
Scott R. Shannon, Image for n=29 with edge-number coloring. This is the first n-gon with 4-gon to 11-gon contacts.
Scott R. Shannon, Image for n=18 with edge-number coloring. This is the only n-gon from n=13 to n=33 that has only 4-gon to 3-gon and 4-gon to 4-gon contacts. It is likely the last n-gon with this property.
Scott R. Shannon, Image for n=18 with random distance-based coloring.

Cf. A333654 (3-gon contacts), A335646 (5-gon contacts), , A337330 (6-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

A335646 Irregular table read by rows: row n gives the number of 5-gon to k-gon contacts, with k>=5, for a regular n-gon with all diagonals drawn.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 39, 42, 15, 0, 15, 0, 102, 18, 190, 38, 19, 20, 80, 273, 210, 21, 154, 44, 529, 322, 69, 144, 750, 350, 598, 156, 26, 1215, 432, 81, 560, 56, 928, 406, 29, 0, 0, 0, 29, 300, 60, 2139, 248, 93, 1568, 704, 64, 1782, 792, 132

Offset: 3

Scott R. Shannon, Aug 23 2020

See A333654 for the number of 3-gon to k-gon contacts, with k>=3.
See A335614 for the number of 4-gon to k-gon contacts, with k>=4.
See A337330 for the number of 6-gon to k-gon contacts, with k>=6.
See A007678 for the number of regions and images of other n-gons.

			The table begins:
.
0;
0;
0;
0;
0;
0;
0;
0;
11;
0;
39;
42;
15,0,15;
0;
102;
18;
190,38,19;
20,80;
273,210,21;
154,44;
529,322,69;
144;
750,350;
598,156,26;
1215,432,81;
560,56;
928,406,29,0,0,0,29;
300,60;
2139,248,93;
1568,704,64;
1782,792,132;

Scott R. Shannon, Image for n=11 with edge-number coloring. This is the first n-gon with 5-gon to 5-gon contacts.
Scott R. Shannon, Image for n=19 with edge-number coloring. This is the first n-gon with 5-gon to 6-gon contacts. It is also the first n-gon with 7-gon to 7-gon contacts.
Scott R. Shannon, Image for n=15 with edge-number coloring. This is the first n-gon with 5-gon to 7-gon contacts.
Scott R. Shannon, Image for n=29 with edge-number coloring. This is the first n-gon with 5-gon to 11-gon contacts.
Scott R. Shannon, Image for n=29 with random distance-based coloring.

Cf. A333654 (3-gon contacts), A335614 (4-gon contacts), A337330 (6-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

A337330 Irregular table read by rows: row n gives the number of 6-gon to k-gon contacts, with k>=6, for a regular n-gon with all diagonals drawn, with n>=25.

Original entry on oeis.org

50, 0, 108, 0, 0, 0, 124, 32, 66, 136, 70, 144, 148, 76, 390, 120, 328, 82, 42, 86, 86, 0, 540, 92, 92, 188, 94, 94, 0, 196, 98, 750, 100, 816, 416, 104, 1272, 432, 220, 110, 728, 570, 570, 406, 348, 116, 1062, 354, 300, 854, 366, 122, 1488, 124, 1512, 252, 126, 576, 2080, 130, 260, 2112

Offset: 25

Scott R. Shannon, Aug 23 2020

For n=3 to n=24 there are no n-gons that have 6-gon to k-gon contacts, where k>=6, so the table starts at n=25.
See A333654 for the number of 3-gon to k-gon contacts, with k>=3.
See A335614 for the number of 4-gon to k-gon contacts, with k>=4.
See A335646 for the number of 5-gon to k-gon contacts, with k>=5.
See A007678 for the number of regions and images of other n-gons.

			The table begins:
.
50;
0;
108;
0;
0;
0;
124;
32;
66;
136;
70;
144;
148;
76;
390;
120;
328, 82;
42;

Scott R. Shannon, Image for n=25 with edge-number coloring. This is the first n-gon with 6-gon to 6-gon contacts.
Scott R. Shannon, Image for n=25 with random distance-based coloring.

Cf. A333654 (3-gon contacts), A335614 (4-gon contacts), A335646 (5-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

a(34) and beyond from Scott R. Shannon, Jan 11 2021

cp's OEIS Frontend

A007678 Number of regions in regular n-gon with all diagonals drawn.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

Extensions

A331450 Irregular triangle read by rows: Take a regular n-sided polygon (n>=3) with all diagonals drawn, as in A007678. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., max_k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A342222 a(n) is the smallest m such that a regular m-gon with all diagonals drawn contains a cell with n sides, or a(n) = -1 if no such m exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A359009 Irregular table read by rows: T(n,k) is the number of k-gons formed, k>=2, when every pair of n points, placed at the vertices of a regular n-gon, are connected by a circle and where the points lie at the ends of the circle's diameter.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A331911 Triangle read by rows: Take an equilateral triangle with all diagonals drawn, as in A092867. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+2 and where n is the number of equal parts each side is divided into.

Views

Author

Keywords

Examples

Links

Crossrefs

A341729 Maximum number of sides in any cell in a regular n-gon with all diagonals drawn (cf. A007678).

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A333654 Irregular table read by rows: row n gives the number of 3-gon to k-gon contacts, with k>=3, for a regular n-gon with all diagonals drawn.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A335614 Irregular table read by rows: row n gives the number of 4-gon to k-gon contacts, with k>=4, for a regular n-gon with all diagonals drawn.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A335646 Irregular table read by rows: row n gives the number of 5-gon to k-gon contacts, with k>=5, for a regular n-gon with all diagonals drawn.

Views

Author

Keywords

Comments