A228592 - cp's OEIS frontend

A228592 a(n) is the smallest number such that if x >= a(n), then pi^(x) - pi^(x/2) >= n, where pi^*(x) is the number of prime powers p^k <= x (k >= 1).

n	a(n)
1	2
2	3
3	7
4	11
5	23
6	27
7	29
8	41
9	59
10	67
11	71
12	79
13	101
14	107
15	109
16	125
17	127
18	149
19	167
20	169
21	179
22	181
23	227
24	229
25	233
26	239
27	263
28	269
29	281
30	283
31	307
32	311
33	347
34	349
35	359
36	367
37	373
38	401
39	409
40	419
41	431
42	433
43	439
44	487
45	491
46	503
47	521
48	569
49	587
50	593
51	599
52	601
53	607
54	617
55	641

[2, 3, 7, 11, 23, 27, 29, 41, 59, 67, 71, 79, 101, 107, 109, 125, 127, 149, 167, 169, 179, 181, 227, 229, 233, 239, 263, 269, 281, 283, 307, 311, 347, 349, 359, 367, 373, 401, 409, 419, 431, 433, 439, 487, 491, 503, 521, 569, 587, 593, 599, 601, 607, 617, 641]

cp's OEIS Frontend

A228592 a(n) is the smallest number such that if x >= a(n), then pi^(x) - pi^(x/2) >= n, where pi^*(x) is the number of prime powers p^k <= x (k >= 1).

Table of values

List of values

n	a(n)
1	2
2	3
3	7
4	11
5	23
6	27
7	29
8	41
9	59
10	67
11	71
12	79
13	101
14	107
15	109
16	125
17	127
18	149
19	167
20	169
21	179
22	181
23	227
24	229
25	233
26	239
27	263
28	269
29	281
30	283
31	307
32	311
33	347
34	349
35	359
36	367
37	373
38	401
39	409
40	419
41	431
42	433
43	439
44	487
45	491
46	503
47	521
48	569
49	587
50	593
51	599
52	601
53	607
54	617
55	641

n	a(n)
1	2
2	3
3	7
4	11
5	23
6	27
7	29
8	41
9	59
10	67
11	71
12	79
13	101
14	107
15	109
16	125
17	127
18	149
19	167
20	169
21	179
22	181
23	227
24	229
25	233
26	239
27	263
28	269
29	281
30	283
31	307
32	311
33	347
34	349
35	359
36	367
37	373
38	401
39	409
40	419
41	431
42	433
43	439
44	487
45	491
46	503
47	521
48	569
49	587
50	593
51	599
52	601
53	607
54	617
55	641

cp's OEIS Frontend

A228592 a(n) is the smallest number such that if x >= a(n), then pi^*(x) - pi^*(x/2) >= n, where pi^*(x) is the number of prime powers p^k <= x (k >= 1).

Table of values

List of values

A228592 a(n) is the smallest number such that if x >= a(n), then pi^(x) - pi^(x/2) >= n, where pi^*(x) is the number of prime powers p^k <= x (k >= 1).

n	a(n)
1	2
2	3
3	7
4	11
5	23
6	27
7	29
8	41
9	59
10	67
11	71
12	79
13	101
14	107
15	109
16	125
17	127
18	149
19	167
20	169
21	179
22	181
23	227
24	229
25	233
26	239
27	263
28	269
29	281
30	283
31	307
32	311
33	347
34	349
35	359
36	367
37	373
38	401
39	409
40	419
41	431
42	433
43	439
44	487
45	491
46	503
47	521
48	569
49	587
50	593
51	599
52	601
53	607
54	617
55	641