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.

A300065 Numbers k such that the number of residues modulo k of the maximum order is different from phi(phi(k)).

Table of values

n a(n)
1 8
2 12
3 21
4 24
5 28
6 33
7 36
8 42
9 44
10 56
11 57
12 63
13 65
14 66
15 69
16 72
17 76
18 77
19 80
20 84
21 88
22 91
23 92
24 93
25 99
26 108
27 114
28 117
29 124
30 126
31 129
32 130
33 132
34 133
35 138
36 141
37 145
38 147
39 152
40 154
41 161
42 168
43 171
44 172
45 177
46 182
47 184
48 185
49 186
50 188
51 189
52 195
53 196
54 198
55 201
56 207
57 208
58 209
59 213
60 216
61 217
62 228
63 231
64 234
65 236
66 237
67 240
68 248
69 249
70 252
71 253
72 258
73 260
74 264
75 265
76 266
77 268
78 273
79 275
80 276
81 279
82 282

List of values

[8, 12, 21, 24, 28, 33, 36, 42, 44, 56, 57, 63, 65, 66, 69, 72, 76, 77, 80, 84, 88, 91, 92, 93, 99, 108, 114, 117, 124, 126, 129, 130, 132, 133, 138, 141, 145, 147, 152, 154, 161, 168, 171, 172, 177, 182, 184, 185, 186, 188, 189, 195, 196, 198, 201, 207, 208, 209, 213, 216, 217, 228, 231, 234, 236, 237, 240, 248, 249, 252, 253, 258, 260, 264, 265, 266, 268, 273, 275, 276, 279, 282]