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.

A341284 a(n) is the least prime == -prime(n) (mod 2*prime(n+1)).

Table of values

n a(n)
2 7
3 23
4 37
5 41
6 89
7 59
8 73
9 151
10 157
11 43
12 127
13 131
14 239
15 59
16 419
17 307
18 73
19 359
20 367
21 401
22 419
23 1163
24 881
25 307
26 311
27 967
28 547
29 569
30 3697
31 397
32 691
33 419
34 457
35 757
36 163
37 821
38 839
39 179
40 1259
41 907
42 2111
43 967
44 1777
45 599
46 223
47 3803
48 3863
49 2063
50 3499
51 1201
52 3617
53 2269
54 263
55 269
56 1889
57 2441
58 283
59 1409

List of values

[7, 23, 37, 41, 89, 59, 73, 151, 157, 43, 127, 131, 239, 59, 419, 307, 73, 359, 367, 401, 419, 1163, 881, 307, 311, 967, 547, 569, 3697, 397, 691, 419, 457, 757, 163, 821, 839, 179, 1259, 907, 2111, 967, 1777, 599, 223, 3803, 3863, 2063, 3499, 1201, 3617, 2269, 263, 269, 1889, 2441, 283, 1409]