A185004 - cp's OEIS frontend

A185004 Ramanujan modulo primes R_(3,1)(n): a(n) is the smallest number such that if x >= a(n), then pi_(3,1)(x) - pi_(3,1)(x/2) >= n, where pi_(3,1)(x) is the number of primes==1 (mod 3) <= x.

n	a(n)
1	7
2	31
3	43
4	67
5	97
6	103
7	151
8	163
9	181
10	223
11	229
12	271
13	331
14	337
15	367
16	373
17	409
18	433
19	487
20	499
21	571
22	577
23	601
24	607
25	631
26	643
27	709
28	727
29	751
30	769
31	823
32	853
33	883
34	937
35	991
36	1009
37	1021
38	1033
39	1051
40	1063
41	1087
42	1117
43	1123
44	1231
45	1291
46	1297
47	1303

[7, 31, 43, 67, 97, 103, 151, 163, 181, 223, 229, 271, 331, 337, 367, 373, 409, 433, 487, 499, 571, 577, 601, 607, 631, 643, 709, 727, 751, 769, 823, 853, 883, 937, 991, 1009, 1021, 1033, 1051, 1063, 1087, 1117, 1123, 1231, 1291, 1297, 1303]

cp's OEIS Frontend

A185004 Ramanujan modulo primes R_(3,1)(n): a(n) is the smallest number such that if x >= a(n), then pi_(3,1)(x) - pi_(3,1)(x/2) >= n, where pi_(3,1)(x) is the number of primes==1 (mod 3) <= x.

Table of values

List of values