cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A309318 a(n) is the number of polygons whose vertices are the (2*n+1)-th roots of unity and whose 2*n+1 sides all have distinct slopes.

Original entry on oeis.org

1, 2, 24, 180, 2700, 74184, 2062800, 81067840, 3912595776
Offset: 1

Views

Author

Ludovic Schwob, Jul 23 2019

Keywords

Comments

The polygons are counted as nonequivalent by reflection and rotation.
No even-sided polygons follow this rule.
This is the number of harmonious labelings on a cycle. See A329910 for the definition of harmonious labelings. - Wenjie Fang, Oct 14 2022

Examples

			For n=2, the a(2)=2 solutions for 2*2+1 = 5 sides are the regular pentagon and pentagram.
		

Crossrefs

Cf. A001710 (number of polygons with n-1 sides), A329910.

Extensions

a(7)-a(9) from Giovanni Resta, Jul 27 2019