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.

A358627 Triangle read by rows: T(n,k) is the number of edges 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 9
2 16
3 40
4 13
5 20
6 20
7 19
8 124
9 17
10 24
11 64
12 24
13 140
14 60
15 204
16 21
17 28
18 60
19 28
20 28
21 74
22 284
23 39
24 300
25 25
26 32
27 32
28 32
29 176
30 32
31 292
32 31
33 68
34 136
35 436
36 29
37 36
38 68
39 36
40 156
41 84
42 36
43 53
44 484
45 158
46 588
47 67
48 612
49 33
50 40
51 72
52 40
53 144
54 80
55 328
56 40
57 520
58 180
59 648
60 76
61 752
62 232
63 764
64 37
65 44
66 44
67 44
68 140
69 44
70 316
71 62
72 44
73 202
74 740
75 43
76 884
77 268
78 148
79 103
80 980
81 41

List of values

[9, 16, 40, 13, 20, 20, 19, 124, 17, 24, 64, 24, 140, 60, 204, 21, 28, 60, 28, 28, 74, 284, 39, 300, 25, 32, 32, 32, 176, 32, 292, 31, 68, 136, 436, 29, 36, 68, 36, 156, 84, 36, 53, 484, 158, 588, 67, 612, 33, 40, 72, 40, 144, 80, 328, 40, 520, 180, 648, 76, 752, 232, 764, 37, 44, 44, 44, 140, 44, 316, 62, 44, 202, 740, 43, 884, 268, 148, 103, 980, 41]