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.

A110174 Number of solutions 0 to the equation phi(n) = phi(k) + phi(n-k), where phi is Euler's totient function.

Table of values

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

List of values

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