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.

A379432 Triangle read by rows: T(n,k) is the number of unsensed 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 7
15 3
16 1
17 1
18 4
19 13
20 13
21 4
22 1
23 1
24 5
25 29
26 44
27 29
28 5
29 1
30 1
31 7
32 51
33 139
34 139
35 51
36 7
37 1
38 1
39 8
40 92
41 370
42 623
43 370
44 92
45 8
46 1
47 1
48 10
49 147
50 913
51 2307
52 2307
53 913
54 147
55 10
56 1
57 1
58 12
59 240
60 2048
61 7644
62 11673
63 7644
64 2048
65 240
66 12
67 1
68 1
69 14
70 357
71 4295
72 22344
73 50174
74 50174
75 22344
76 4295
77 357
78 14
79 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 7, 3, 1, 1, 4, 13, 13, 4, 1, 1, 5, 29, 44, 29, 5, 1, 1, 7, 51, 139, 139, 51, 7, 1, 1, 8, 92, 370, 623, 370, 92, 8, 1, 1, 10, 147, 913, 2307, 2307, 913, 147, 10, 1, 1, 12, 240, 2048, 7644, 11673, 7644, 2048, 240, 12, 1, 1, 14, 357, 4295, 22344, 50174, 50174, 22344, 4295, 357, 14, 1]