A212438 Irregular triangle read by rows: T(n,k) is the number of polyhedra with n faces and k vertices (n >= 4, k=4..2n-4).
1, 0, 1, 1, 0, 1, 2, 2, 2, 0, 0, 2, 8, 11, 8, 5, 0, 0, 2, 11, 42, 74, 76, 38, 14, 0, 0, 0, 8, 74, 296, 633, 768, 558, 219, 50, 0, 0, 0, 5, 76, 633, 2635, 6134, 8822, 7916, 4442, 1404, 233, 0, 0, 0, 0, 38, 768, 6134, 25626, 64439, 104213, 112082, 79773, 36528, 9714, 1249
Offset: 4
Examples
Triangle begins: 1 0 1 1 0 1 2 2 2 0 0 2 8 11 8 5 0 0 2 11 42 74 76 38 14 0 0 0 8 74 296 633 768 558 219 50 0 0 0 5 76 633 2635 6134 8822 7916 4442 1404 233 ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 4..199 (rows 4..17)
- Gunnar Brinkmann and Brendan McKay, Fast generation of planar graphs (expanded edition), Table 9-11.
- G. P. Michon, Counting Polyhedra
Crossrefs
Extensions
Terms a(53) and beyond from Andrew Howroyd, Mar 27 2021
Comments