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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 0
4 2
5 0
6 0
7 3
8 3
9 0
10 0
11 4
12 20
13 4
14 0
15 0
16 5
17 75
18 75
19 5
20 0
21 0
22 6
23 210
24 604
25 210
26 6
27 0
28 0
29 7
30 490
31 3150
32 3150
33 490
34 7
35 0
36 0
37 8
38 1008
39 12480
40 27556
41 12480
42 1008
43 8
44 0
45 0
46 9
47 1890
48 40788
49 170793
50 170793
51 40788
52 1890
53 9
54 0
55 0
56 10
57 3300
58 115500
59 829920
60 1565844
61 829920
62 115500
63 3300
64 10
65 0

List of values

[1, 1, 1, 0, 2, 0, 0, 3, 3, 0, 0, 4, 20, 4, 0, 0, 5, 75, 75, 5, 0, 0, 6, 210, 604, 210, 6, 0, 0, 7, 490, 3150, 3150, 490, 7, 0, 0, 8, 1008, 12480, 27556, 12480, 1008, 8, 0, 0, 9, 1890, 40788, 170793, 170793, 40788, 1890, 9, 0, 0, 10, 3300, 115500, 829920, 1565844, 829920, 115500, 3300, 10, 0]