OFFSET
4,3
REFERENCES
B. Poonen and M. Rubinstein, Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics, Vol. 11, pp. 135-156.
LINKS
Scott R. Shannon, Table of n, a(n) for n = 4..765
Sascha Kurz, m-gons in regular n-gons
B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon, arXiv:math/9508209 [math.MG], 1995-2006, which has fewer typos than the SIAM version.
B. Poonen and M. Rubinstein, Mathematica programs for these sequences
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).]
FORMULA
Conjecture: a(n) ~ c * n^4. Is c = 1/64 ? - Bill McEachen, Mar 03 2024
EXAMPLE
a(6)=6 because the 6 regions around the center are quadrilaterals.
CROSSREFS
KEYWORD
nonn
AUTHOR
Sascha Kurz, Jan 06 2002
EXTENSIONS
Title clarified, a(47) and above by Scott R. Shannon, Dec 04 2021
STATUS
approved
