A063545 Largest number of triangulations of n points in the plane.

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

Offset

3,2

References

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

Links

Table of n, a(n) for n=3..11.

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.

F. Santos and R. Seidel, A better upper bound on the number of triangulations of a planar point set, Journal of Combinatorial Theory, Series A, 102(1):186-193, 2003.

Crossrefs

Cf. A063544.

Sequence in context: A000751 A000744 A047046 * A061058 A060795 A071743

Adjacent sequences: A063542 A063543 A063544 * A063546 A063547 A063548

Keyword

nonn,nice,hard

Author

N. J. A. Sloane, Aug 14 2001

Extensions

a(11) added from Brass, Moser & Pach by Andrey Zabolotskiy, Jan 01 2022

Status

approved