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.
%I A375986 #67 Jul 22 2025 19:32:41 %S A375986 3,12,22 %N A375986 Maximum number of edges in a simple polygon that is the union of n triangles. %C A375986 By an explicit construction, a(n) >= 11*n-11 for all n >= 4. %H A375986 Giedrius Alkauskas, <a href="/A375986/a375986_1.png">Construction which shows that for n >= 4, a(n) >= 11*n-11</a>. %H A375986 Math Stackexchange, <a href="https://math.stackexchange.com/questions/4724701/if-a-union-of-n-triangles-is-a-simple-m-gon-find-the-maximum-of-m">If a union of n triangles is a simple M-gon, find the maximum of M</a>. %e A375986 For n = 1, one has three vertices of a single triangle. %e A375986 For n = 2 the example is a hexagram (the star of David). %K A375986 nonn,bref %O A375986 1,1 %A A375986 _Giedrius Alkauskas_, Sep 07 2024