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.

A371065 a(1)=2; for n > 1, a(n) is the least prime number p > a(n-1) such that p + 2^(n-1) is a prime number.

Table of values

n a(n)
1 2
2 3
3 7
4 11
5 13
6 29
7 37
8 53
9 61
10 89
11 127
12 131
13 157
14 197
15 223
16 269
17 307
18 359
19 367
20 419
21 463
22 491
23 547
24 593
25 607
26 641
27 643
28 701
29 823
30 947
31 1213
32 1229
33 1237
34 1319
35 1327
36 1451
37 1723
38 2381
39 3019
40 3299
41 3307
42 3371
43 3847
44 4493
45 4621
46 4931
47 5179
48 5783
49 6043
50 6197
51 6469

List of values

[2, 3, 7, 11, 13, 29, 37, 53, 61, 89, 127, 131, 157, 197, 223, 269, 307, 359, 367, 419, 463, 491, 547, 593, 607, 641, 643, 701, 823, 947, 1213, 1229, 1237, 1319, 1327, 1451, 1723, 2381, 3019, 3299, 3307, 3371, 3847, 4493, 4621, 4931, 5179, 5783, 6043, 6197, 6469]