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.

A287615 Let r = prime(n). Then a(n) is the smallest prime p such that there is a prime q with p > q > r and p mod q = r.

Table of values

n a(n)
1 5
2 13
3 19
4 29
5 37
6 47
7 79
8 101
9 97
10 103
11 113
12 131
13 127
14 137
15 181
16 199
17 181
18 227
19 233
20 229
21 239
22 257
23 277
24 283
25 311
26 307
27 317
28 409
29 383
30 367
31 389
32 409
33 439
34 521
35 463
36 509
37 491
38 509
39 613
40 571
41 541
42 563
43 577
44 587
45 619
46 653
47 677
48 677
49 709
50 743
51 787
52 853
53 743
54 877

List of values

[5, 13, 19, 29, 37, 47, 79, 101, 97, 103, 113, 131, 127, 137, 181, 199, 181, 227, 233, 229, 239, 257, 277, 283, 311, 307, 317, 409, 383, 367, 389, 409, 439, 521, 463, 509, 491, 509, 613, 571, 541, 563, 577, 587, 619, 653, 677, 677, 709, 743, 787, 853, 743, 877]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.