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.

A333819 a(n) is the least integer q > 0 such that for some integer r, phi(q) + phi(r) = 2*n; where phi(n) is Euler's totient function (A000010).

Table of values

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

List of values

[1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 7, 3, 3, 3, 3, 5, 3, 5, 3, 5, 3, 5, 3, 3, 3, 3, 3, 3, 3, 5, 3, 5, 3, 5, 7, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 3, 3, 5, 7, 3, 5, 3, 3, 3, 3, 3, 5, 3, 5, 3, 3, 3, 5, 3, 5, 7, 3, 3, 5, 3, 3, 3, 5, 3, 5, 3]