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.

A340811 Array read by antidiagonals: T(n,k) is the number of unlabeled k-gonal 2-trees with n polygons, n >= 0, k >= 2.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 1
11 1
12 1
13 2
14 3
15 1
16 1
17 1
18 3
19 5
20 6
21 1
22 1
23 1
24 3
25 8
26 12
27 11
28 1
29 1
30 1
31 4
32 11
33 32
34 39
35 23
36 1
37 1
38 1
39 4
40 16
41 56
42 141
43 136
44 47
45 1
46 1
47 1
48 5
49 20
50 103
51 359
52 749
53 529
54 106
55 1
56 1
57 1
58 5
59 26
60 158
61 799
62 2597
63 4304
64 2171
65 235
66 1
67 1
68 1
69 6
70 32
71 245
72 1539
73 7286
74 20386
75 26492
76 9368
77 551

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 3, 5, 6, 1, 1, 1, 3, 8, 12, 11, 1, 1, 1, 4, 11, 32, 39, 23, 1, 1, 1, 4, 16, 56, 141, 136, 47, 1, 1, 1, 5, 20, 103, 359, 749, 529, 106, 1, 1, 1, 5, 26, 158, 799, 2597, 4304, 2171, 235, 1, 1, 1, 6, 32, 245, 1539, 7286, 20386, 26492, 9368, 551]