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.

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

Table of values

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

List of values

[2, 5, 11, 13, 19, 23, 29, 37, 47, 53, 59, 61, 67, 71, 83, 97, 101, 107, 131, 139, 149, 163, 167, 173, 179, 181, 191, 193, 197, 211, 227, 239, 263, 269, 293, 307, 311, 313, 317, 347, 349, 359, 373, 379, 383, 389, 409, 419, 421, 431, 443, 461, 467, 479, 491, 499, 503, 509, 523]

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

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