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.

A349999 Least number m of primes that must have appeared in an interval [j^2, (j+1)^2], such that all intervals [k^2, (k+1)^2], k>j contain more than m primes. The corresponding values of j are A349998.

Table of values

n a(n)
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 16
14 18
15 19
16 22
17 24
18 26
19 27
20 28
21 29
22 30
23 32
24 33
25 35
26 36
27 38
28 39
29 40
30 41
31 44
32 45
33 47
34 51
35 54
36 56
37 63
38 65
39 68
40 70
41 71
42 78
43 80
44 85
45 94
46 99
47 106
48 107
49 114
50 115
51 120
52 121
53 127
54 133
55 138
56 146
57 154
58 155
59 164
60 168
61 169
62 175
63 176
64 177

List of values

[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 18, 19, 22, 24, 26, 27, 28, 29, 30, 32, 33, 35, 36, 38, 39, 40, 41, 44, 45, 47, 51, 54, 56, 63, 65, 68, 70, 71, 78, 80, 85, 94, 99, 106, 107, 114, 115, 120, 121, 127, 133, 138, 146, 154, 155, 164, 168, 169, 175, 176, 177]