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.

A079020 Suppose p and q = p+20 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 56 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.

Table of values

n a(n)
1 3
2 11
3 17
4 23
5 41
6 47
7 59
8 83
9 89
10 107
11 131
12 137
13 179
14 191
15 251
16 293
17 317
18 347
19 353
20 359
21 389
22 401
23 467
24 503
25 521
26 593
27 599
28 653
29 887
30 947
31 971
32 1031
33 1151
34 1193
35 1229
36 1259
37 1301
38 1307
39 1439
40 1601
41 1931
42 1979
43 1997
44 2069
45 2531
46 3167
47 3299
48 4241
49 5261
50 5639
51 5849
52 8081
53 10091
54 17189
55 18041
56 19421

List of values

[3, 11, 17, 23, 41, 47, 59, 83, 89, 107, 131, 137, 179, 191, 251, 293, 317, 347, 353, 359, 389, 401, 467, 503, 521, 593, 599, 653, 887, 947, 971, 1031, 1151, 1193, 1229, 1259, 1301, 1307, 1439, 1601, 1931, 1979, 1997, 2069, 2531, 3167, 3299, 4241, 5261, 5639, 5849, 8081, 10091, 17189, 18041, 19421]