cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
4 1
5 1
6 1
7 1
8 2
9 2
10 2
11 2
12 8
13 11
14 8
15 5
16 2
17 11
18 42
19 74
20 76
21 38
22 14
23 8
24 74
25 296
26 633
27 768
28 558
29 219
30 50
31 5
32 76
33 633
34 2635
35 6134
36 8822
37 7916
38 4442
39 1404
40 233
41 38
42 768
43 6134
44 25626
45 64439
46 104213
47 112082
48 79773
49 36528
50 9714
51 1249
52 14
53 558
54 8822
55 64439
56 268394
57 709302

List of values

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