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.

A342701 a(n) is the second smallest k such that phi(n+k) = phi(k), or 0 if no such solution exists.

Table of values

n a(n)
1 3
2 7
3 5
4 14
5 9
6 34
7 7
8 16
9 15
10 26
11 11
12 68
13 39
14 28
15 15
16 32
17 33
18 72
19 25
20 40
21 35
22 56
23 17
24 101
25 45
26 37
27 45
28 56
29 29
30 152
31 31
32 61
33 39
34 56
35 35
36 144
37 37
38 61
39 39
40 74
41 41
42 128
43 35
44 88
45 45
46 161
47 47
48 192
49 49
50 82
51 51
52 74
53 95
54 216
55 43
56 97
57 75
58 203
59 59
60 304
61 91
62 88
63 63
64 122

List of values

[3, 7, 5, 14, 9, 34, 7, 16, 15, 26, 11, 68, 39, 28, 15, 32, 33, 72, 25, 40, 35, 56, 17, 101, 45, 37, 45, 56, 29, 152, 31, 61, 39, 56, 35, 144, 37, 61, 39, 74, 41, 128, 35, 88, 45, 161, 47, 192, 49, 82, 51, 74, 95, 216, 43, 97, 75, 203, 59, 304, 91, 88, 63, 122]

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

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