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.

A229990 Numbers k such that the interval [floor((k+1)/2), floor(3*(k+1)/2)] contains more primes than the interval [floor(k/2), floor(3*k/2)] does.

Table of values

n a(n)
1 1
2 3
3 4
4 8
5 12
6 19
7 20
8 24
9 28
10 31
11 40
12 44
13 48
14 52
15 55
16 64
17 67
18 68
19 71
20 72
21 84
22 91
23 92
24 99
25 100
26 104
27 108
28 111
29 115
30 120
31 127
32 128
33 131
34 132
35 140
36 148
37 151
38 152
39 155
40 160
41 171
42 175
43 180
44 184
45 187
46 188
47 204
48 208
49 211
50 220
51 224
52 231
53 232
54 235
55 239
56 244
57 248
58 252

List of values

[1, 3, 4, 8, 12, 19, 20, 24, 28, 31, 40, 44, 48, 52, 55, 64, 67, 68, 71, 72, 84, 91, 92, 99, 100, 104, 108, 111, 115, 120, 127, 128, 131, 132, 140, 148, 151, 152, 155, 160, 171, 175, 180, 184, 187, 188, 204, 208, 211, 220, 224, 231, 232, 235, 239, 244, 248, 252]