A210467 - cp's OEIS frontend

A210467 Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)n, p_(3,2)(m+1)n) contains exactly one prime == 2 (mod 3).

n	a(n)
2	2
3	2
4	101
5	263
6	1097
7	251
8	311
9	461
10	641
11	941
12	1601
13	2351
14	2543
15	5003
16	2837
17	4787
18	5711
19	4283
20	7901
21	10331
22	8831
23	2687
24	7877
25	54287
26	5711
27	5501
28	5303
29	56087
30	69827
31	15641
32	63611
33	138581
34	106427
35	91571
36	69827
37	266177
38	142421
39	177533
40	179687
41	309311
42	55691
43	119291
44	509543
45	593987
46	1393913

[2, 2, 101, 263, 1097, 251, 311, 461, 641, 941, 1601, 2351, 2543, 5003, 2837, 4787, 5711, 4283, 7901, 10331, 8831, 2687, 7877, 54287, 5711, 5501, 5303, 56087, 69827, 15641, 63611, 138581, 106427, 91571, 69827, 266177, 142421, 177533, 179687, 309311, 55691, 119291, 509543, 593987, 1393913]

cp's OEIS Frontend

A210467 Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)n, p_(3,2)(m+1)n) contains exactly one prime == 2 (mod 3).

Table of values

List of values

cp's OEIS Frontend

A210467 Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)*n, p_(3,2)(m+1)*n) contains exactly one prime == 2 (mod 3).

Table of values

List of values

A210467 Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)n, p_(3,2)(m+1)n) contains exactly one prime == 2 (mod 3).