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.

A351103 a(n) is the total number of polygons left over with maximum number of sides when partitioning the set of vertices of a convex n-gon into nonintersecting polygons.

Table of values

n a(n)
3 0
4 0
5 0
6 3
7 7
8 12
9 3
10 10
11 22
12 3
13 13
14 35
15 3
16 16
17 51
18 3
19 19
20 70
21 3
22 22
23 92
24 3
25 25
26 117
27 3
28 28
29 145
30 3
31 31
32 176
33 3
34 34
35 210
36 3
37 37
38 247
39 3
40 40
41 287
42 3
43 43
44 330
45 3
46 46
47 376
48 3
49 49
50 425
51 3
52 52
53 477
54 3
55 55
56 532
57 3
58 58
59 590
60 3
61 61
62 651
63 3
64 64
65 715
66 3
67 67
68 782
69 3
70 70
71 852
72 3
73 73
74 925

List of values

[0, 0, 0, 3, 7, 12, 3, 10, 22, 3, 13, 35, 3, 16, 51, 3, 19, 70, 3, 22, 92, 3, 25, 117, 3, 28, 145, 3, 31, 176, 3, 34, 210, 3, 37, 247, 3, 40, 287, 3, 43, 330, 3, 46, 376, 3, 49, 425, 3, 52, 477, 3, 55, 532, 3, 58, 590, 3, 61, 651, 3, 64, 715, 3, 67, 782, 3, 70, 852, 3, 73, 925]