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.

A110179 Least k such that phi(n+k) = 2*phi(n), where phi is Euler's totient function.

Table of values

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

List of values

[2, 1, 2, 1, 10, 2, 6, 7, 4, 5, 14, 3, 22, 7, 2, 1, 34, 3, 18, 12, 14, 3, 46, 8, 16, 9, 10, 7, 58, 2, 30, 19, 8, 17, 30, 3, 36, 19, 26, 11, 82, 3, 86, 11, 20, 23, 94, 3, 80, 5, 34, 13, 106, 3, 68, 9, 16, 29, 118, 4, 82, 15, 10, 21, 32, 9, 94, 17, 20, 34, 142, 32, 112, 17, 48, 15, 66, 26]