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.

A020497 Conjecturally, this is the minimal y such that n primes occur infinitely often among (x+1, ..., x+y), that is, pi(x+y) - pi(x) >= n for infinitely many x.

Table of values

n a(n)
1 1
2 3
3 7
4 9
5 13
6 17
7 21
8 27
9 31
10 33
11 37
12 43
13 49
14 51
15 57
16 61
17 67
18 71
19 77
20 81
21 85
22 91
23 95
24 101
25 111
26 115
27 121
28 127
29 131
30 137
31 141
32 147
33 153
34 157
35 159
36 163
37 169
38 177
39 183
40 187
41 189
42 197
43 201
44 211
45 213
46 217
47 227
48 237
49 241
50 247
51 253
52 255
53 265
54 271
55 273
56 279
57 283
58 289
59 301
60 305

List of values

[1, 3, 7, 9, 13, 17, 21, 27, 31, 33, 37, 43, 49, 51, 57, 61, 67, 71, 77, 81, 85, 91, 95, 101, 111, 115, 121, 127, 131, 137, 141, 147, 153, 157, 159, 163, 169, 177, 183, 187, 189, 197, 201, 211, 213, 217, 227, 237, 241, 247, 253, 255, 265, 271, 273, 279, 283, 289, 301, 305]