8085725

Appears in sequences

• 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=66A058788
• 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=67A058788
• Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).at n=9A058789