|
Search: id:A063544
|
|
|
| A063544 |
|
Smallest number of triangulations of n points in the plane. |
|
+0
2
|
| |
|
|
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
|
O. Aichholzer and H. Krasser, The point set order type data base: a collection of applications and results, pp. 17-20 in Abstracts 13-th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 13-15, 2001.
|
|
CROSSREFS
|
Cf. A063545.
Sequence in context: A148148 A148149 A034769 this_sequence A148150 A073193 A148151
Adjacent sequences: A063541 A063542 A063543 this_sequence A063545 A063546 A063547
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Aug 14 2001
|
|
|
Search completed in 0.002 seconds
|
