A063545 - OEIS

%I #13 Jan 01 2022 09:57:12

%S 1,2,5,14,42,150,780,4550,26888

%N Largest number of triangulations of n points in the plane.

%D P. Brass, W. O. J. Moser, J. Pach, Research Problems in Discrete Geometry, Springer (2005)

%H O. Aichholzer and H. Krasser, <a href="https://www.cccg.ca/proceedings/2001/hkrasser-17690.ps.gz">The point set order type data base: a collection of applications and results</a>, pp. 17-20 in Abstracts 13th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 13-15, 2001.

%H F. Santos and R. Seidel, <a href="https://doi.org/10.1016/S0097-3165(03)00002-5">A better upper bound on the number of triangulations of a planar point set</a>, Journal of Combinatorial Theory, Series A, 102(1):186-193, 2003.

%Y Cf. A063544.

%K nonn,nice,hard

%O 3,2

%A _N. J. A. Sloane_, Aug 14 2001

%E a(11) added from Brass, Moser & Pach by _Andrey Zabolotskiy_, Jan 01 2022