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.

A279756 Smallest prime p >= prime(n) such that p == 2 (mod prime(n)).

Table of values

n a(n)
1 2
2 5
3 7
4 23
5 13
6 41
7 19
8 59
9 71
10 31
11 157
12 113
13 43
14 131
15 331
16 373
17 61
18 307
19 337
20 73
21 367
22 239
23 251
24 269
25 293
26 103
27 311
28 109
29 547
30 1019
31 383
32 919
33 139
34 419
35 151
36 757
37 787
38 491
39 503
40 521
41 181
42 907
43 193
44 967
45 199
46 599
47 1901
48 1117
49 229
50 2063
51 701
52 241
53 3617
54 1759
55 773

List of values

[2, 5, 7, 23, 13, 41, 19, 59, 71, 31, 157, 113, 43, 131, 331, 373, 61, 307, 337, 73, 367, 239, 251, 269, 293, 103, 311, 109, 547, 1019, 383, 919, 139, 419, 151, 757, 787, 491, 503, 521, 181, 907, 193, 967, 199, 599, 1901, 1117, 229, 2063, 701, 241, 3617, 1759, 773]