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.

A066493 a(n) = least k such that f(k) = n, where f is the prime gaps function given by f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.

Table of values

n a(n)
1 1
2 2
3 0
4 4
5 0
6 9
7 0
8 24
9 0
10 34
11 0
12 46
13 0
14 30
15 0
16 282
17 0
18 99
19 0
20 154
21 0
22 189
23 0
24 263
25 0
26 367
27 0
28 429
29 0
30 590
31 0
32 738
33 0
34 217
35 0
36 1183
37 0
38 3302
39 0
40 2191
41 0
42 1879
43 0
44 1831
45 0
46 7970
47 0
48 3077
49 0
50 3427

List of values

[1, 2, 0, 4, 0, 9, 0, 24, 0, 34, 0, 46, 0, 30, 0, 282, 0, 99, 0, 154, 0, 189, 0, 263, 0, 367, 0, 429, 0, 590, 0, 738, 0, 217, 0, 1183, 0, 3302, 0, 2191, 0, 1879, 0, 1831, 0, 7970, 0, 3077, 0, 3427]