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.

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

Table of values

n a(n)
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 4
12 4
13 1
14 2
15 8
16 12
17 6
18 1
19 3
20 16
21 40
22 43
23 19
24 1
25 3
26 25
27 93
28 165
29 143
30 49
31 1
32 4
33 40
34 197
35 505
36 712
37 504
38 150
39 1
40 4
41 56
42 364
43 1274
44 2548
45 2912
46 1768
47 442
48 1
49 5
50 80
51 646
52 2878
53 7672
54 12400
55 11976
56 6310
57 1424
58 1
59 5
60 105
61 1050
62 5880
63 19992
64 42840
65 58140
66 48450
67 22610
68 4522

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 4, 4, 1, 2, 8, 12, 6, 1, 3, 16, 40, 43, 19, 1, 3, 25, 93, 165, 143, 49, 1, 4, 40, 197, 505, 712, 504, 150, 1, 4, 56, 364, 1274, 2548, 2912, 1768, 442, 1, 5, 80, 646, 2878, 7672, 12400, 11976, 6310, 1424, 1, 5, 105, 1050, 5880, 19992, 42840, 58140, 48450, 22610, 4522]