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.

A352883 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 floor(n/2) vertices to its left, then floor(n/2)-1 vertices to its left, then floor(n/2)-2 vertices ... 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 11
19 14
20 17
21 20
22 24
23 1
24 2
25 4
26 7
27 10
28 13
29 17
30 22
31 25
32 29
33 33
34 37
35 41
36 45
37 50
38 1
39 2
40 4
41 6
42 8
43 11
44 14
45 18
46 22
47 26
48 30
49 35
50 40
51 44
52 49
53 54
54 59
55 64
56 69
57 74
58 80
59 1
60 2
61 4
62 7
63 11
64 15
65 19
66 24
67 30
68 37
69 42
70 48
71 55
72 62
73 69
74 76
75 83
76 91
77 100
78 105
79 111
80 117
81 123
82 129
83 135
84 141
85 147
86 154

List of values

[1, 1, 2, 4, 1, 2, 4, 6, 8, 11, 1, 2, 4, 6, 8, 11, 14, 17, 20, 24, 1, 2, 4, 7, 10, 13, 17, 22, 25, 29, 33, 37, 41, 45, 50, 1, 2, 4, 6, 8, 11, 14, 18, 22, 26, 30, 35, 40, 44, 49, 54, 59, 64, 69, 74, 80, 1, 2, 4, 7, 11, 15, 19, 24, 30, 37, 42, 48, 55, 62, 69, 76, 83, 91, 100, 105, 111, 117, 123, 129, 135, 141, 147, 154]