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.

A249801 Take smallest prime q such that n*(q+1)+1 is prime (A249800), that is, the smallest prime q so that n = (p-1)/(q+1) with p prime; sequence gives values of p; or -1 if A249800(n) = -1.

Table of values

n a(n)
1 5
2 7
3 13
4 13
5 31
6 19
7 29
8 97
9 37
10 31
11 67
12 37
13 53
14 43
15 61
16 97
17 103
18 73
19 229
20 61
21 127
22 67
23 139
24 73
25 101
26 79
27 109
28 113
29 233
30 181
31 373
32 97
33 199
34 103
35 211
36 109
37 149
38 229
39 157
40 241
41 739
42 127
43 173
44 353
45 181
46 139
47 283
48 193
49 197
50 151
51 307
52 157
53 743
54 163
55 331
56 337
57 229

List of values

[5, 7, 13, 13, 31, 19, 29, 97, 37, 31, 67, 37, 53, 43, 61, 97, 103, 73, 229, 61, 127, 67, 139, 73, 101, 79, 109, 113, 233, 181, 373, 97, 199, 103, 211, 109, 149, 229, 157, 241, 739, 127, 173, 353, 181, 139, 283, 193, 197, 151, 307, 157, 743, 163, 331, 337, 229]