A058788 - cp's OEIS frontend

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.

n	a(n)
6	1
7	1
8	1
9	1
10	2
11	2
12	2
13	2
14	8
15	2
16	11
17	11
18	8
19	42
20	8
21	5
22	74
23	74
24	5
25	76
26	296
27	76
28	38
29	633
30	633
31	38
32	14
33	768
34	2635
35	768
36	14
37	558
38	6134
39	6134
40	558
41	219
42	8822
43	25626
44	8822
45	219
46	50
47	7916
48	64439
49	64439
50	7916
51	50
52	4442
53	104213
54	268394
55	104213
56	4442
57	1404
58	112082
59	709302
60	709302
61	112082
62	1404
63	233
64	79773
65	1263032
66	2937495
67	1263032
68	79773
69	233
70	36528
71	1556952
72	8085725
73	8085725
74	1556952
75	36528
76	9714
77	1338853
78	15535572
79	33310550

[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]

cp's OEIS Frontend

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.

Table of values

List of values