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.

A295634 Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation and reflection.

Table of values

n a(n)
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 3
12 3
13 1
14 2
15 6
16 7
17 4
18 1
19 3
20 11
21 24
22 24
23 12
24 1
25 3
26 17
27 51
28 89
29 74
30 27
31 1
32 4
33 26
34 109
35 265
36 371
37 259
38 82
39 1
40 4
41 36
42 194
43 660
44 1291
45 1478
46 891
47 228
48 1
49 5
50 50
51 345
52 1477
53 3891
54 6249
55 6044
56 3176
57 733
58 1
59 5
60 65
61 550
62 3000
63 10061
64 21524
65 29133
66 24302
67 11326
68 2282

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 3, 3, 1, 2, 6, 7, 4, 1, 3, 11, 24, 24, 12, 1, 3, 17, 51, 89, 74, 27, 1, 4, 26, 109, 265, 371, 259, 82, 1, 4, 36, 194, 660, 1291, 1478, 891, 228, 1, 5, 50, 345, 1477, 3891, 6249, 6044, 3176, 733, 1, 5, 65, 550, 3000, 10061, 21524, 29133, 24302, 11326, 2282]