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.

A358574 Triangle read by rows: T(n,k) is the number of vertices 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 8
2 12
3 20
4 12
5 16
6 16
7 16
8 64
9 16
10 20
11 36
12 20
13 68
14 36
15 100
16 20
17 24
18 36
19 24
20 24
21 44
22 144
23 29
24 144
25 24
26 28
27 28
28 28
29 92
30 28
31 140
32 28
33 44
34 76
35 208
36 28
37 32
38 44
39 32
40 84
41 52
42 32
43 39
44 240
45 88
46 292
47 46
48 296
49 32
50 36
51 48
52 36
53 80
54 52
55 164
56 36
57 252
58 100
59 316
60 52
61 368
62 124
63 364
64 36
65 40
66 40
67 40
68 80
69 40
70 164
71 47
72 40
73 112
74 364
75 40
76 436
77 144
78 88
79 67
80 472
81 40

List of values

[8, 12, 20, 12, 16, 16, 16, 64, 16, 20, 36, 20, 68, 36, 100, 20, 24, 36, 24, 24, 44, 144, 29, 144, 24, 28, 28, 28, 92, 28, 140, 28, 44, 76, 208, 28, 32, 44, 32, 84, 52, 32, 39, 240, 88, 292, 46, 296, 32, 36, 48, 36, 80, 52, 164, 36, 252, 100, 316, 52, 368, 124, 364, 36, 40, 40, 40, 80, 40, 164, 47, 40, 112, 364, 40, 436, 144, 88, 67, 472, 40]