login
A375986
Maximum number of edges in a simple polygon that is the union of n triangles.
1
OFFSET
1,1
COMMENTS
By an explicit construction, a(n) >= 10n-8 for all n >= 2. a(4) >= 33, a(5) >= 44.
LINKS
Giedrius Alkauskas, Three configurations
Giedrius Alkauskas, Construction which shows that a(n) >= 10*n-8.
EXAMPLE
For n = 1, one has three vertices of a single triangle.
For n = 2 the example is provided by a configuration that is the star of David.
CROSSREFS
Sequence in context: A051656 A074004 A088099 * A110419 A031223 A063598
KEYWORD
nonn,bref
AUTHOR
Giedrius Alkauskas, Sep 07 2024
STATUS
approved