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.

A081754 Numbers n such that the number of noncongruent solutions to x^(2^m) == 1 (mod n) is the same for any m>=1.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 6
6 7
7 8
8 9
9 11
10 12
11 14
12 18
13 19
14 21
15 22
16 23
17 24
18 27
19 28
20 31
21 33
22 36
23 38
24 42
25 43
26 44
27 46
28 47
29 49
30 54
31 56
32 57
33 59
34 62
35 63
36 66
37 67
38 69
39 71
40 72
41 76
42 77
43 79
44 81
45 83
46 84
47 86
48 88
49 92
50 93
51 94
52 98
53 99
54 103
55 107
56 108
57 114
58 118
59 121
60 124
61 126
62 127
63 129
64 131
65 132
66 133
67 134

List of values

[1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 18, 19, 21, 22, 23, 24, 27, 28, 31, 33, 36, 38, 42, 43, 44, 46, 47, 49, 54, 56, 57, 59, 62, 63, 66, 67, 69, 71, 72, 76, 77, 79, 81, 83, 84, 86, 88, 92, 93, 94, 98, 99, 103, 107, 108, 114, 118, 121, 124, 126, 127, 129, 131, 132, 133, 134]