709302

Appears in sequences

• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).at n=53A058787
• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=53A058788
• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=54A058788
• Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).at n=8A058789