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.

A358556 Triangle read by rows: T(n,k) is the number of regions formed when n points are placed along each edge of a square that divide the edges into n+1 equal parts and a line is continuously drawn from the current point to that k points, 2 <= k <= 2*n, counterclockwise around the square until the starting point is again reached.

Table of values

n a(n)
1 2
2 5
3 21
4 2
5 5
6 5
7 4
8 61
9 2
10 5
11 29
12 5
13 73
14 25
15 105
16 2
17 5
18 25
19 5
20 5
21 31
22 141
23 11
24 157
25 2
26 5
27 5
28 5
29 85
30 5
31 153
32 4
33 25
34 61
35 229
36 2
37 5
38 25
39 5
40 73
41 33
42 5
43 15
44 245
45 71
46 297
47 22
48 317
49 2
50 5
51 25
52 5
53 65
54 29
55 165
56 5
57 269
58 81
59 333
60 25
61 385
62 109
63 401
64 2
65 5
66 5
67 5
68 61
69 5
70 153
71 16
72 5
73 91
74 377
75 4
76 449
77 125
78 61
79 37
80 509
81 2

List of values

[2, 5, 21, 2, 5, 5, 4, 61, 2, 5, 29, 5, 73, 25, 105, 2, 5, 25, 5, 5, 31, 141, 11, 157, 2, 5, 5, 5, 85, 5, 153, 4, 25, 61, 229, 2, 5, 25, 5, 73, 33, 5, 15, 245, 71, 297, 22, 317, 2, 5, 25, 5, 65, 29, 165, 5, 269, 81, 333, 25, 385, 109, 401, 2, 5, 5, 5, 61, 5, 153, 16, 5, 91, 377, 4, 449, 125, 61, 37, 509, 2]