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.

A360114 Numbers k such that m^(1 + 2^v(k-1)) == -m (mod k) has only one solution (with 0 <= m < k), where v(k) = A007814(k) is the 2-adic valuation of k.

Table of values

n a(n)
1 3
2 5
3 7
4 9
5 11
6 13
7 17
8 19
9 21
10 23
11 25
12 27
13 29
14 31
15 33
16 37
17 41
18 43
19 45
20 47
21 49
22 53
23 57
24 59
25 61
26 63
27 65
28 67
29 69
30 71
31 73
32 77
33 79
34 81
35 83
36 89
37 93
38 97
39 99
40 101
41 103
42 105
43 107
44 109
45 113
46 117
47 121
48 125
49 127
50 129
51 131
52 133
53 137
54 139
55 141
56 145
57 147
58 149
59 151
60 157
61 161
62 163
63 165
64 167
65 169
66 171
67 173
68 177
69 179

List of values

[3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 33, 37, 41, 43, 45, 47, 49, 53, 57, 59, 61, 63, 65, 67, 69, 71, 73, 77, 79, 81, 83, 89, 93, 97, 99, 101, 103, 105, 107, 109, 113, 117, 121, 125, 127, 129, 131, 133, 137, 139, 141, 145, 147, 149, 151, 157, 161, 163, 165, 167, 169, 171, 173, 177, 179]