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.

A352533 Irregular table read by rows: T(n,k) is the number of regions formed after k diagonals, with k>=0, are drawn between vertices of a regular n-gon, with n>=3, when each vertex is fully connected to all other vertices in counterclockwise order before the next vertex, in counterclockwise order, is chosen.

Table of values

n a(n)
3 1
4 1
5 2
6 4
7 1
8 2
9 3
10 5
11 8
12 11
13 1
14 2
15 3
16 4
17 6
18 9
19 13
20 16
21 20
22 24
23 1
24 2
25 3
26 4
27 5
28 7
29 10
30 14
31 19
32 22
33 27
34 34
35 38
36 45
37 50
38 1
39 2
40 3
41 4
42 5
43 6
44 8
45 11
46 15
47 20
48 26
49 29
50 34
51 39
52 46
53 50
54 56
55 62
56 67
57 74
58 80
59 1
60 2
61 3
62 4
63 5
64 6
65 7
66 9
67 12
68 16
69 21
70 27
71 34
72 37
73 42
74 49
75 58
76 69
77 73
78 80
79 90
80 103
81 108
82 117
83 130
84 136
85 147
86 154

List of values

[1, 1, 2, 4, 1, 2, 3, 5, 8, 11, 1, 2, 3, 4, 6, 9, 13, 16, 20, 24, 1, 2, 3, 4, 5, 7, 10, 14, 19, 22, 27, 34, 38, 45, 50, 1, 2, 3, 4, 5, 6, 8, 11, 15, 20, 26, 29, 34, 39, 46, 50, 56, 62, 67, 74, 80, 1, 2, 3, 4, 5, 6, 7, 9, 12, 16, 21, 27, 34, 37, 42, 49, 58, 69, 73, 80, 90, 103, 108, 117, 130, 136, 147, 154]