A058786 -id:A058786 - cp's OEIS frontend

A342053 Array read by antidiagonals: T(n,k) is the number of unrooted 3-connected triangulations of a disk with n interior nodes and k nodes on the boundary, n >= 1, k >= 3.

1, 1, 1, 1, 2, 4, 1, 2, 8, 16, 1, 3, 12, 38, 78, 1, 3, 20, 73, 219, 457, 1, 4, 27, 140, 503, 1404, 2938, 1, 4, 39, 235, 1089, 3661, 9714, 20118, 1, 5, 51, 392, 2149, 8796, 27715, 70454, 144113, 1, 5, 68, 610, 4050, 19419, 72204, 214664, 527235, 1065328

Offset: 1

Andrew Howroyd, Feb 26 2021

For k >= 4, T(n,k) is the number of polyhedra with n+k vertices whose faces are all triangular, except one which is k-gonal.

The initial terms of this sequence can also be computed using the tool "plantri", in particular the command "./plantri -u -v -P [n]" will compute values for a diagonal.

			Array begins:
===================================================
n\k |     3     4      5      6       7       8
----+----------------------------------------------
  1 |     1     1      1      1       1       1 ...
  2 |     1     2      2      3       3       4 ...
  3 |     4     8     12     20      27      39 ...
  4 |    16    38     73    140     235     392 ...
  5 |    78   219    503   1089    2149    4050 ...
  6 |   457  1404   3661   8796   19419   40485 ....
  7 |  2938  9714  27715  72204  173779  393123 ...
  8 | 20118 70454 214664 596906 1538221 3723976 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 1..1275
G. Brinkmann and B. McKay, Plantri (program for generation of certain types of planar graph)
William G. Brown, Enumeration of Triangulations of the Disk, Proc. Lond. Math. Soc. s3-14 (1964) 746-768.
Andrew Howroyd, PARI Program

Columns k=3..6 are A002713, A058786(n+4), A342054, A342055.
Antidiagonal sums are A342056.
Cf. A169808 (2-connected), A341856 (rooted), A341923 (oriented).

A342053Array(8,6) \\ See links for program.

A058787 Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 2, 8, 11, 8, 5, 2, 11, 42, 74, 76, 38, 14, 8, 74, 296, 633, 768, 558, 219, 50, 5, 76, 633, 2635, 6134, 8822, 7916, 4442, 1404, 233, 38, 768, 6134, 25626, 64439, 104213, 112082, 79773, 36528, 9714, 1249, 14, 558, 8822, 64439, 268394, 709302

Offset: 4

Gerard P. Michon, Nov 29 2000

Rows are of lengths 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, ... floor(3n/2)-5. See A001651 (this is the sequence of integers not divisible by 3).

			There are 38 polyhedra with 9 faces and 11 vertices, or with 11 faces and 9 vertices.

G. P. Michon, Counting Polyhedra

Cf. A000109, A002856, A000944, A002840, A058786, A058788, A001651.

A049337, A058787, A212438 are all versions of the same triangle.

A058788 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.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 2, 8, 2, 11, 11, 8, 42, 8, 5, 74, 74, 5, 76, 296, 76, 38, 633, 633, 38, 14, 768, 2635, 768, 14, 558, 6134, 6134, 558, 219, 8822, 25626, 8822, 219, 50, 7916, 64439, 64439, 7916, 50, 4442, 104213, 268394, 104213, 4442, 1404, 112082, 709302, 709302, 112082, 1404, 233, 79773, 1263032, 2937495, 1263032, 79773, 233, 36528, 1556952, 8085725, 8085725, 1556952, 36528, 9714, 1338853, 15535572, 33310550

Offset: 6

Gerard P. Michon, Nov 29 2000

Rows are of lengths 1,0,1,2,1,2,3,2,3,4,3,4,5,4,5,6,5, ... n-1-2*floor((n+2)/3). See A008611. Note the zero length, which means that there are no polyhedra with n=7 edges.

			There are 768 different polyhedra with 18 edges and 9 or 11 faces.

G. P. Michon, Counting Polyhedra

Cf. A000109, A002856, A000944, A002840, A058786, A058787, A049337, A008611.

A058789 Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).

Original entry on oeis.org

0, 1, 2, 11, 74, 633, 6134, 64439, 709302, 8085725, 94713809, 1134914458, 13865916560, 172301697581, 2173270387051

Offset: 4

Gerard P. Michon, Nov 30 2000

Through a(18) the only primes are 2, 11, and 64439. - Jonathan Vos Post, Apr 23 2011

			a(5)=1 because the triangular prism is the only pentahedron with 6 vertices.

G. P. Michon, Counting Polyhedra

Cf. A002856, A000109, A058786, A058787, A058788.

cp's OEIS Frontend

A342053 Array read by antidiagonals: T(n,k) is the number of unrooted 3-connected triangulations of a disk with n interior nodes and k nodes on the boundary, n >= 1, k >= 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A058787 Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A058788 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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A058789 Number of polyhedra with n faces and n+1 vertices (or n vertices and n+1 faces).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs