login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A063542
Least number of empty convex quadrilaterals (4-gons) determined by n points in the plane.
3
0, 1, 3, 6, 10, 15, 23, 32, 42, 51
OFFSET
4,3
REFERENCES
K. Dehnhardt. Leere konvexe Vielecke in ebenen Punktmengen. PhD thesis, TU Braunschweig, Germany, 1987.
LINKS
O. Aichholzer and H. Krasser, The point set order type data base: a collection of applications and results, pp. 17-20 in Abstracts 13th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 13-15, 2001.
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. Lower bounds for the number of small convex k-holes. Computational Geometry: Theory and Applications, 47(5):605-613, 2014.
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, A. Pilz, B. Vogtenhuber, A set of 12 points minimizing the numbers of convex 3-, 4-, and 5-holes.
M. Scheucher, Counting Convex 5-Holes, Bachelor's thesis, Graz University of Technology, Austria, 2013, in German.
CROSSREFS
Cf. A063541 and A276096 for empty convex 3- and 5-gons (a.k.a. k-holes), respectively. The rectilinear crossing number A014540 is the number of (not necessarily empty) convex quadrilaterals.
Sequence in context: A373962 A342211 A262927 * A294413 A122554 A111734
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 14 2001
EXTENSIONS
a(11)-a(13) from Manfred Scheucher, Aug 17 2018
STATUS
approved