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.

A002181 Least number k such that phi(k) = m, where m runs through the values (A002202) taken by phi.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 15
6 11
7 13
8 17
9 19
10 25
11 23
12 35
13 29
14 31
15 51
16 37
17 41
18 43
19 69
20 47
21 65
22 53
23 81
24 87
25 59
26 61
27 85
28 67
29 71
30 73
31 79
32 123
33 83
34 129
35 89
36 141
37 97
38 101
39 103
40 159
41 107
42 109
43 121
44 113
45 177
46 143
47 127
48 255
49 131
50 161
51 137
52 139
53 213
54 185
55 149
56 151
57 157
58 187
59 163
60 249
61 167
62 203
63 173

List of values

[1, 3, 5, 7, 15, 11, 13, 17, 19, 25, 23, 35, 29, 31, 51, 37, 41, 43, 69, 47, 65, 53, 81, 87, 59, 61, 85, 67, 71, 73, 79, 123, 83, 129, 89, 141, 97, 101, 103, 159, 107, 109, 121, 113, 177, 143, 127, 255, 131, 161, 137, 139, 213, 185, 149, 151, 157, 187, 163, 249, 167, 203, 173]