Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).
A058787
Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =2a(7) =2a(8) =8a(9) =11a(10) =8a(11) =5a(12) =2a(13) =11a(14) =42a(15) =74a(16) =76a(17) =38a(18) =14a(19) =8a(20) =74a(21) =296a(22) =633a(23) =768a(24) =558a(25) =219a(26) =50a(27) =5a(28) =76a(29) =633
External references
- oeis: A058787