login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063544 Smallest number of triangulations of n points in the plane. 1
1, 1, 2, 4, 11, 30, 89, 250 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,3

REFERENCES

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

LINKS

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

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.

CROSSREFS

Cf. A063545.

Sequence in context: A193062 A193061 A193060 * A276145 A148150 A219232

Adjacent sequences:  A063541 A063542 A063543 * A063545 A063546 A063547

KEYWORD

nonn,nice,hard

AUTHOR

N. J. A. Sloane, Aug 14 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 08:35 EDT 2020. Contains 336368 sequences. (Running on oeis4.)