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.

A385122 a(n) = d(phi(n)) - phi(d(n)) where d(n) = A000005(n) is the number of divisors and phi(n) = A000010(n) is the Euler totient function.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 2
6 0
7 3
8 1
9 2
10 1
11 3
12 1
13 5
14 2
15 2
16 0
17 4
18 2
19 5
20 2
21 4
22 2
23 3
24 0
25 4
26 4
27 4
28 4
29 5
30 0
31 7
32 3
33 4
34 3
35 6
36 0
37 8
38 4
39 6
40 1
41 7
42 2
43 7
44 4
45 6
46 2
47 3
48 1
49 6
50 4
51 4
52 6
53 5
54 2
55 6
56 4
57 7
58 4
59 3
60 1
61 11
62 6
63 7
64 0
65 8
66 2
67 7
68 4
69 4
70 4
71 7
72 4
73 11
74 7
75 6
76 7
77 10
78 4
79 7
80 2
81 4
82 6
83 3
84 4
85 5
86 6

List of values

[0, 0, 1, 0, 2, 0, 3, 1, 2, 1, 3, 1, 5, 2, 2, 0, 4, 2, 5, 2, 4, 2, 3, 0, 4, 4, 4, 4, 5, 0, 7, 3, 4, 3, 6, 0, 8, 4, 6, 1, 7, 2, 7, 4, 6, 2, 3, 1, 6, 4, 4, 6, 5, 2, 6, 4, 7, 4, 3, 1, 11, 6, 7, 0, 8, 2, 7, 4, 4, 4, 7, 4, 11, 7, 6, 7, 10, 4, 7, 2, 4, 6, 3, 4, 5, 6]