Number of simplicial polyhedra with n vertices; simple planar graphs with n vertices and 3n-6 edges; maximal simple planar graphs with n vertices; planar triangulations with n vertices; triangulations of the sphere with n vertices; 3-connected cubic planar graphs on 2n-4 vertices.
A000109
Number of simplicial polyhedra with n vertices; simple planar graphs with n vertices and 3n-6 edges; maximal simple planar graphs with n vertices; planar triangulations with n vertices; triangulations of the sphere with n vertices; 3-connected cubic planar graphs on 2n-4 vertices.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =5a(5) =14a(6) =50a(7) =233a(8) =1249a(9) =7595a(10) =49566a(11) =339722a(12) =2406841a(13) =17490241a(14) =129664753a(15) =977526957a(16) =7475907149a(17) =57896349553a(18) =453382272049
External references
- oeis: A000109