We denote by a triangulation a (simple) maximal planar graph. How many triangulations on $n$ vertices are there? How many triangulations are there if we cannot distinguish the vertices, i.e. isomorphic triangulations are seen as equal?
All results I can find are for plane graphs, i.e. concrete embeddings, and not abstract graphs.