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.

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

Table of values

n a(n)
1 3
2 3
3 5
4 5
5 15
6 8
7 13
8 15
9 13
10 15
11 25
12 15
13 35
14 21
15 17
16 17
17 51
18 21
19 37
20 32
21 35
22 25
23 69
24 32
25 41
26 35
27 37
28 35
29 87
30 32
31 61
32 51
33 41
34 51
35 65
36 39
37 73
38 57
39 65
40 51
41 123
42 45
43 129
44 55
45 65
46 69
47 141
48 51
49 129
50 55
51 85
52 65
53 159
54 57
55 123
56 65
57 73
58 87
59 177
60 64
61 143
62 77
63 73
64 85
65 97
66 75
67 161
68 85

List of values

[3, 3, 5, 5, 15, 8, 13, 15, 13, 15, 25, 15, 35, 21, 17, 17, 51, 21, 37, 32, 35, 25, 69, 32, 41, 35, 37, 35, 87, 32, 61, 51, 41, 51, 65, 39, 73, 57, 65, 51, 123, 45, 129, 55, 65, 69, 141, 51, 129, 55, 85, 65, 159, 57, 123, 65, 73, 87, 177, 64, 143, 77, 73, 85, 97, 75, 161, 85]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.