OFFSET
3,5
LINKS
Robin Visser, Table of n, a(n) for n = 3..95
Bjorn Poonen and Michael Rubinstein, The Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics 11 (1998), nr. 1, pp. 135-156; doi: 10.1137/S0895480195281246; arXiv: math.MG/9508209.
Eric Weisstein's World of Mathematics, Regular Polygon Division by Diagonals.
FORMULA
a(n) = 1/24*n*(n-3)*(n-5)*(2*n-11) for n odd
PROG
(Sage)
def a(n):
K = CyclotomicField(n); z = K.gen(); S = set()
for i in range(n):
for j in range(i+2, n):
for k in range(j+1, n):
for l in range(k+2, n+i):
x = (z^(i-j)-z^(j-i))*(z^l-z^k)-(z^(k-l)-z^(l-k))*(z^j-z^i)
y = (z^-j-z^-i)*(z^l-z^k)-(z^-l-z^-k)*(z^j-z^i)
if (not y.is_zero()): S.add(x/y)
return len(S) # Robin Visser, Jul 29 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Martin Renner, Feb 07 2013
EXTENSIONS
a(17)-a(29) from Martin Renner, Feb 24 2013
More terms from Robin Visser, Jul 29 2024
STATUS
approved