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.

A291554 Primes q for which there exists a prime p < q such that 2^q == 2^p (mod pq).

Table of values

n a(n)
1 31
2 73
3 89
4 109
5 113
6 127
7 151
8 157
9 193
10 233
11 241
12 257
13 281
14 307
15 313
16 331
17 337
18 353
19 397
20 433
21 457
22 499
23 577
24 593
25 601
26 641
27 673
28 683
29 811
30 919
31 953
32 1013
33 1049
34 1103
35 1153
36 1163
37 1201
38 1217
39 1249
40 1321
41 1327
42 1399
43 1429
44 1433
45 1459
46 1471
47 1553
48 1601
49 1613
50 1657
51 1709
52 1721
53 1753
54 1777
55 1789
56 1801
57 1873
58 1913
59 1933
60 1993

List of values

[31, 73, 89, 109, 113, 127, 151, 157, 193, 233, 241, 257, 281, 307, 313, 331, 337, 353, 397, 433, 457, 499, 577, 593, 601, 641, 673, 683, 811, 919, 953, 1013, 1049, 1103, 1153, 1163, 1201, 1217, 1249, 1321, 1327, 1399, 1429, 1433, 1459, 1471, 1553, 1601, 1613, 1657, 1709, 1721, 1753, 1777, 1789, 1801, 1873, 1913, 1933, 1993]