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.

A276096 a(n) is the least number of empty convex pentagons ("convex 5-holes") spanned by a set of n points in the Euclidean plane in general position (i.e., no three points on a line).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 3, 6, 9, 11
Offset: 1

Views

Author

Manfred Scheucher, Aug 18 2016

Keywords

Comments

The value a(10) = 1 was determined by Harborth, who also constructed a set of 9 points without convex 5-holes. The values a(11) = 2 and a(13) = 3 were determined by Dehnhardt. Aichholzer found point sets showing that a(14) <= 6 and a(15) <= 9, and the exact values a(13) = 3, a(14) = 6, and a(15) = 9 were determined in the Bachelor's thesis of Scheucher, supervised by Aichholzer and Hackl.
The value a(16) = 11 was determined using a ILP/SAT solver. For more information check out the link below with title "On 5-Holes". - Manfred Scheucher, Aug 18 2018

References

  • K. Dehnhardt, Leere konvexe Vielecke in ebenen Punktmengen, PhD thesis, TU Braunschweig, Germany, 1987, in German.

Crossrefs

Cf. A063541 and A063542 for convex 3- and 4-holes, respectively.
Cf. A006247 and A063666 for equivalence classes (w.r.t. orientation triples) of point sets in the plane.

Formula

From Manfred Scheucher, Mar 22 2017: (Start)
a(n) = Omega(n log^(4/5)(n)) and a(n) = O(n^2).
Conjecture: a(n) = Theta(n^2). (End)

Extensions

a(16) from Manfred Scheucher, Mar 22 2017