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.

A072514 Sum of n mod k for k in {1...n} with gcd(k,n) > 1.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 2
7 0
8 2
9 3
10 8
11 0
12 9
13 0
14 16
15 17
16 16
17 0
18 27
19 0
20 31
21 31
22 44
23 0
24 52
25 20
26 56
27 36
28 69
29 0
30 92
31 0
32 72
33 77
34 102
35 68
36 127
37 0
38 128
39 97
40 152
41 0
42 192
43 0
44 165
45 153
46 196
47 0
48 230
49 56
50 231
51 170
52 237
53 0
54 319
55 154
56 290
57 211
58 302
59 0
60 421
61 0
62 334
63 273
64 334
65 192
66 478
67 0
68 411
69 317

List of values

[0, 0, 0, 0, 0, 2, 0, 2, 3, 8, 0, 9, 0, 16, 17, 16, 0, 27, 0, 31, 31, 44, 0, 52, 20, 56, 36, 69, 0, 92, 0, 72, 77, 102, 68, 127, 0, 128, 97, 152, 0, 192, 0, 165, 153, 196, 0, 230, 56, 231, 170, 237, 0, 319, 154, 290, 211, 302, 0, 421, 0, 334, 273, 334, 192, 478, 0, 411, 317]