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.

A352866 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 in turn is connected to the vertex two to its left, then three to its left, then four... until all vertices are connected by diagonals.

Table of values

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

List of values

[1, 1, 2, 4, 1, 2, 4, 6, 8, 11, 1, 2, 4, 6, 8, 10, 13, 16, 20, 24, 1, 2, 4, 6, 8, 10, 12, 15, 18, 22, 27, 32, 37, 43, 50, 1, 2, 4, 6, 8, 10, 12, 14, 17, 20, 24, 29, 34, 39, 44, 50, 57, 62, 68, 74, 80, 1, 2, 4, 6, 8, 10, 12, 14, 16, 19, 22, 26, 31, 36, 41, 46, 51, 57, 64, 71, 79, 88, 98, 108, 118, 129, 141, 154]