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.

A072989 Numbers m>0 such that the number of solutions to x^m==1 (mod m), 1<=x<=m, is not equal to gcd(m, phi(m)).

Table of values

n a(n)
1 20
2 30
3 40
4 42
5 52
6 60
7 66
8 68
9 70
10 78
11 80
12 84
13 90
14 100
15 102
16 104
17 110
18 114
19 116
20 120
21 126
22 130
23 132
24 136
25 138
26 140
27 148
28 150
29 154
30 156
31 160
32 164
33 168
34 170
35 171
36 174
37 180
38 182
39 186
40 190
41 198
42 200
43 204
44 208
45 210
46 212
47 220
48 222
49 228
50 230
51 232
52 234
53 238
54 240

List of values

[20, 30, 40, 42, 52, 60, 66, 68, 70, 78, 80, 84, 90, 100, 102, 104, 110, 114, 116, 120, 126, 130, 132, 136, 138, 140, 148, 150, 154, 156, 160, 164, 168, 170, 171, 174, 180, 182, 186, 190, 198, 200, 204, 208, 210, 212, 220, 222, 228, 230, 232, 234, 238, 240]