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.

A176175 Numbers k such that (2^(k-1) mod k) = number of prime divisors of k (counted with multiplicity).

Table of values

n a(n)
1 1
2 3
3 5
4 6
5 7
6 10
7 11
8 13
9 14
10 17
11 19
12 22
13 23
14 26
15 29
16 31
17 34
18 37
19 38
20 41
21 43
22 46
23 47
24 53
25 58
26 59
27 61
28 62
29 67
30 71
31 73
32 74
33 79
34 82
35 83
36 86
37 89
38 94
39 97
40 101
41 103
42 106
43 107
44 109
45 113
46 118
47 122
48 127
49 131
50 134
51 137
52 139
53 142
54 146
55 149
56 151
57 157
58 158
59 163
60 166
61 167
62 173
63 178
64 179
65 181
66 191
67 193
68 194
69 197
70 199
71 202
72 206
73 211
74 214
75 218
76 223
77 226
78 227
79 229
80 233
81 239
82 241
83 251
84 254

List of values

[1, 3, 5, 6, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 34, 37, 38, 41, 43, 46, 47, 53, 58, 59, 61, 62, 67, 71, 73, 74, 79, 82, 83, 86, 89, 94, 97, 101, 103, 106, 107, 109, 113, 118, 122, 127, 131, 134, 137, 139, 142, 146, 149, 151, 157, 158, 163, 166, 167, 173, 178, 179, 181, 191, 193, 194, 197, 199, 202, 206, 211, 214, 218, 223, 226, 227, 229, 233, 239, 241, 251, 254]