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.

A342985 Triangle read by rows: T(n,k) is the number of tree-rooted loopless planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 2
5 0
6 0
7 3
8 3
9 0
10 0
11 4
12 36
13 4
14 0
15 0
16 5
17 135
18 135
19 5
20 0
21 0
22 6
23 360
24 1368
25 360
26 6
27 0
28 0
29 7
30 798
31 7350
32 7350
33 798
34 7
35 0
36 0
37 8
38 1568
39 28400
40 73700
41 28400
42 1568
43 8
44 0
45 0
46 9
47 2826
48 89073
49 474588
50 474588
51 89073
52 2826
53 9
54 0
55 0
56 10
57 4770
58 241220
59 2292790
60 4818092
61 2292790
62 241220
63 4770
64 10
65 0

List of values

[1, 0, 0, 0, 2, 0, 0, 3, 3, 0, 0, 4, 36, 4, 0, 0, 5, 135, 135, 5, 0, 0, 6, 360, 1368, 360, 6, 0, 0, 7, 798, 7350, 7350, 798, 7, 0, 0, 8, 1568, 28400, 73700, 28400, 1568, 8, 0, 0, 9, 2826, 89073, 474588, 474588, 89073, 2826, 9, 0, 0, 10, 4770, 241220, 2292790, 4818092, 2292790, 241220, 4770, 10, 0]