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.

A365001 Primes from which it is not possible to reach a (different) Mersenne prime by toggling a single bit per step while still remaining prime at every step.

Table of values

n a(n)
1 73
2 89
3 127
4 173
5 191
6 233
7 239
8 251
9 257
10 277
11 337
12 349
13 373
14 431
15 443
16 491
17 557
18 653
19 683
20 701
21 733
22 761
23 769
24 773
25 787
26 853
27 907
28 911
29 971
30 1019
31 1093
32 1109
33 1117
34 1193
35 1201
36 1237
37 1297
38 1301
39 1303
40 1361
41 1367
42 1373
43 1381
44 1399
45 1429
46 1453
47 1489
48 1493

List of values

[73, 89, 127, 173, 191, 233, 239, 251, 257, 277, 337, 349, 373, 431, 443, 491, 557, 653, 683, 701, 733, 761, 769, 773, 787, 853, 907, 911, 971, 1019, 1093, 1109, 1117, 1193, 1201, 1237, 1297, 1301, 1303, 1361, 1367, 1373, 1381, 1399, 1429, 1453, 1489, 1493]