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.

A001916 Primes p such that the congruence 2^x = 5 (mod p) is solvable.

Table of values

n a(n)
1 2
2 3
3 11
4 13
5 19
6 29
7 37
8 41
9 53
10 59
11 61
12 67
13 71
14 79
15 83
16 101
17 107
18 131
19 139
20 149
21 163
22 173
23 179
24 181
25 191
26 197
27 199
28 211
29 227
30 239
31 251
32 269
33 271
34 293
35 311
36 317
37 347
38 349
39 359
40 373
41 379
42 389
43 401
44 409
45 419
46 421
47 443
48 449
49 461
50 467
51 479
52 491
53 509
54 521
55 523
56 541
57 547
58 557

List of values

[2, 3, 11, 13, 19, 29, 37, 41, 53, 59, 61, 67, 71, 79, 83, 101, 107, 131, 139, 149, 163, 173, 179, 181, 191, 197, 199, 211, 227, 239, 251, 269, 271, 293, 311, 317, 347, 349, 359, 373, 379, 389, 401, 409, 419, 421, 443, 449, 461, 467, 479, 491, 509, 521, 523, 541, 547, 557]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.