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.

A015126 Least k such that phi(k) = phi(n).

Table of values

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

List of values

[1, 1, 3, 3, 5, 3, 7, 5, 7, 5, 11, 5, 13, 7, 15, 15, 17, 7, 19, 15, 13, 11, 23, 15, 25, 13, 19, 13, 29, 15, 31, 17, 25, 17, 35, 13, 37, 19, 35, 17, 41, 13, 43, 25, 35, 23, 47, 17, 43, 25, 51, 35, 53, 19, 41, 35, 37, 29, 59, 17, 61, 31, 37, 51, 65, 25, 67, 51, 69, 35, 71, 35, 73]

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

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