OFFSET
0,4
COMMENTS
Polygons that differ by rotation or reflection are counted separately.
By "n+2-sided polygons" we mean the polygons that can be drawn by connecting n+2 equally spaced points on a circle (possibly self-intersecting).
T(0,0)=1 by convention.
To compute the number of turns, follow the edges of the polygon, and add the angles of rotation: positive if turning left, negative if turning right. Then take the absolute value of the sum (see illustration).
LINKS
Ludovic Schwob, Illustration of T(5,k), 0 <= k <= 3
FORMULA
T(2*n-1,n)=1 for all n >= 1: the only solution is the polygon with Schläfli symbol {2*n+1/n}.
EXAMPLE
Triangle begins:
1;
0, 1;
2, 1;
5, 6, 1;
24, 28, 8;
119, 183, 57, 1;
CROSSREFS
KEYWORD
nonn,tabf,more
AUTHOR
Ludovic Schwob, Apr 01 2021
STATUS
approved