login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262244 Number of concave equilateral n-gons with corner angles of m*Pi/n (0 < m < 2n), where m and n are integers. 3
0, 0, 1, 22, 11, 1319, 36279 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,4

COMMENTS

An n-gon is a polygon with n corners and n sides, each of which is a straight line segment joining two corners. A polygon P is said to be a simple polygon (or a Jordan polygon) if the only points of the plane belonging to multiple edges of P are the corners of P. Such a polygon has a well-defined interior and exterior. Simple polygons are topologically equivalent to a disk, hence zero angles are not allowed; allowable angles are m*Pi/n (where m and n are integers and 0 < m < 2n). A simple n-gon is concave iff at least one of its internal angles is greater than Pi, or equivalently m > n for at least one of the corners. The sum of the m-numbers (called angle factors) for the n-gon has to be n*(n-2). They are partitions of n*(n-2) into n parts with largest part n < k < 2n, and as the edges of a polygon form a closed path, the sum of unit vectors defined by the angle coordinates m/Pi is zero. The reason the m-numbers sum to n*(n-2) is that the sum of the interior angles of any n-gon is Pi*(n-2), and as angles are m*Pi/n, n = Pi.

Observation: when n is prime, m is odd and m != n.

LINKS

Table of n, a(n) for n=3..9.

Stuart E Anderson, n-gon, produces postscript images of convex, concave and intersecting polygons for n, along with an unsorted list of interior angle multiples m for each polygon. One rotationally invariant representative polygon is produced in postscript.

Stuart E Anderson, concave pentagon

Stuart E Anderson, concave hexagons

Stuart E Anderson, concave heptagons

Stuart E Anderson, concave octagons

EXAMPLE

For n = 5, the a(5) = 1 solution is (1 3 3 1 7) in m angle factors.

For n = 7, the a(7) = 11 solutions in m angle factors are as follows: (1 11 5 3 5 5 5), (1 5 3 9 1 5 11), (1 5 5 1 11 1 11), (1 5 5 5 1 9 9), (1 5 5 5 3 5 11), (1 9 1 9 3 3 9), (1 9 3 5 1 11 5), (1 9 3 5 5 3 9), (3 3 5 5 3 3 13), (3 3 9 3 5 3 9), (3 5 5 5 5 3 9).

CROSSREFS

Cf. A262181 (convex equilateral polygons).

Sequence in context: A040465 A108732 A033967 * A140872 A133724 A196030

Adjacent sequences:  A262241 A262242 A262243 * A262245 A262246 A262247

KEYWORD

nonn,hard,more

AUTHOR

Stuart E Anderson, Sep 15 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 10:05 EDT 2019. Contains 328146 sequences. (Running on oeis4.)