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.

A342061 Triangle read by rows: T(n,k) is the number of sensed 2-connected (nonseparable) planar maps with n edges and k vertices, n >= 2, 2 <= k <= n.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 2
11 1
12 1
13 3
14 8
15 3
16 1
17 1
18 4
19 16
20 16
21 4
22 1
23 1
24 5
25 38
26 63
27 38
28 5
29 1
30 1
31 7
32 72
33 218
34 218
35 72
36 7
37 1
38 1
39 8
40 134
41 622
42 1075
43 622
44 134
45 8
46 1
47 1
48 10
49 224
50 1600
51 4214
52 4214
53 1600
54 224
55 10
56 1
57 1
58 12
59 375
60 3703
61 14381
62 22222
63 14381
64 3703
65 375
66 12
67 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 8, 3, 1, 1, 4, 16, 16, 4, 1, 1, 5, 38, 63, 38, 5, 1, 1, 7, 72, 218, 218, 72, 7, 1, 1, 8, 134, 622, 1075, 622, 134, 8, 1, 1, 10, 224, 1600, 4214, 4214, 1600, 224, 10, 1, 1, 12, 375, 3703, 14381, 22222, 14381, 3703, 375, 12, 1]