OEIS A000944 · polyhedra with n vertices
A polyhedron's skeleton is a 3-connected planar graph (Steinitz), so A000944 counts them: 1, 2, 7, 34, 257, 2606, 32300, … for n = 4, 5, 6, … (the OEIS lists n ≤ 18; the counts here for n = 19 to 40 are new, by formula). Each row below is a random sample of distinct polyhedra with n vertices, drawn in canonical form (every edge tangent to the unit sphere, so symmetric graphs look symmetric). Hover or tap one to mark its relatives in the sample.