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.

A378639 a(n) = sum of all m such that phi(m) divides n, where phi is the Euler totient function (A000010).

Table of values

n a(n)
1 3
2 16
3 3
4 51
5 3
6 64
7 3
8 156
9 3
10 49
11 3
12 265
13 3
14 16
15 3
16 387
17 3
18 202
19 3
20 302
21 3
22 85
23 3
24 991
25 3
26 16
27 3
28 138
29 3
30 190
31 3
32 968
33 3
34 16
35 3
36 1058
37 3
38 16
39 3
40 1240
41 3
42 340
43 3
44 419
45 3
46 157
47 3
48 2736
49 3
50 49
51 3
52 210
53 3
54 445
55 3
56 620
57 3
58 193
59 3
60 1723
61 3
62 16
63 3
64 2283
65 3
66 334
67 3
68 51
69 3
70 262

List of values

[3, 16, 3, 51, 3, 64, 3, 156, 3, 49, 3, 265, 3, 16, 3, 387, 3, 202, 3, 302, 3, 85, 3, 991, 3, 16, 3, 138, 3, 190, 3, 968, 3, 16, 3, 1058, 3, 16, 3, 1240, 3, 340, 3, 419, 3, 157, 3, 2736, 3, 49, 3, 210, 3, 445, 3, 620, 3, 193, 3, 1723, 3, 16, 3, 2283, 3, 334, 3, 51, 3, 262]