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.

A178942 a(1) = 3; for n >= 2, a(n) is the smallest prime q > a(n-1) such that, for the previous prime p and the following prime r, the fraction (q-p)/(r-q) has denominator equal to A001223(n)/2 (or 0, if no such prime exists).

Table of values

n a(n)
1 3
2 5
3 11
4 13
5 17
6 19
7 29
8 37
9 47
10 53
11 61
12 67
13 71
14 79
15 83
16 131
17 137
18 151
19 163
20 173
21 233
22 277
23 331
24 359
25 379
26 397
27 401
28 419
29 439
30 773
31 823
32 941
33 947
34 1021
35 1031
36 1033
37 1063
38 1087
39 1097
40 1117
41 1123
42 1153
43 1187
44 1237
45 1277
46 1709
47 1789
48 1823

List of values

[3, 5, 11, 13, 17, 19, 29, 37, 47, 53, 61, 67, 71, 79, 83, 131, 137, 151, 163, 173, 233, 277, 331, 359, 379, 397, 401, 419, 439, 773, 823, 941, 947, 1021, 1031, 1033, 1063, 1087, 1097, 1117, 1123, 1153, 1187, 1237, 1277, 1709, 1789, 1823]