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.

A335354 a(n) is the number of edges in the central polygon formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.

Table of values

n a(n)
1 0
2 8
3 4
4 8
5 12
6 16
7 12
8 16
9 20
10 16
11 20
12 24
13 28
14 24
15 28
16 32
17 28
18 32
19 36
20 32
21 36
22 40
23 44
24 40
25 44
26 48
27 44
28 48
29 52
30 56
31 52
32 56
33 60
34 56
35 60
36 64
37 68
38 64
39 68
40 72
41 68
42 72
43 76
44 72
45 76
46 80
47 84
48 80
49 84
50 88
51 84
52 88
53 92
54 96
55 92
56 96
57 100
58 96
59 100
60 104
61 100
62 104
63 108
64 112

List of values

[0, 8, 4, 8, 12, 16, 12, 16, 20, 16, 20, 24, 28, 24, 28, 32, 28, 32, 36, 32, 36, 40, 44, 40, 44, 48, 44, 48, 52, 56, 52, 56, 60, 56, 60, 64, 68, 64, 68, 72, 68, 72, 76, 72, 76, 80, 84, 80, 84, 88, 84, 88, 92, 96, 92, 96, 100, 96, 100, 104, 100, 104, 108, 112]