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.

A375986 Maximum number of edges in a simple polygon that is the union of n triangles.

Original entry on oeis.org

3, 12, 22
Offset: 1

Views

Author

Giedrius Alkauskas, Sep 07 2024

Keywords

Comments

By an explicit construction, a(n) >= 11*n-11 for all n >= 4.

Examples

			For n = 1, one has three vertices of a single triangle.
For n = 2 the example is a hexagram (the star of David).