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.

A000230 a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.

Table of values

n a(n)
0 2
1 3
2 7
3 23
4 89
5 139
6 199
7 113
8 1831
9 523
10 887
11 1129
12 1669
13 2477
14 2971
15 4297
16 5591
17 1327
18 9551
19 30593
20 19333
21 16141
22 15683
23 81463
24 28229
25 31907
26 19609
27 35617
28 82073
29 44293
30 43331
31 34061
32 89689
33 162143
34 134513
35 173359
36 31397
37 404597
38 212701
39 188029
40 542603
41 265621
42 461717
43 155921
44 544279
45 404851
46 927869
47 1100977
48 360653
49 604073

List of values

[2, 3, 7, 23, 89, 139, 199, 113, 1831, 523, 887, 1129, 1669, 2477, 2971, 4297, 5591, 1327, 9551, 30593, 19333, 16141, 15683, 81463, 28229, 31907, 19609, 35617, 82073, 44293, 43331, 34061, 89689, 162143, 134513, 173359, 31397, 404597, 212701, 188029, 542603, 265621, 461717, 155921, 544279, 404851, 927869, 1100977, 360653, 604073]