A210465 - cp's OEIS frontend

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

n	a(n)
2	7
3	13
4	193
5	271
6	157
7	193
8	1297
9	1741
10	1231
11	1033
12	3541
13	1447
14	727
15	2341
16	9337
17	1747
18	9007
19	2287
20	3307
21	14401
22	8887
23	8161
24	8461
25	28753
26	23623
27	23893
28	10861
29	59233
30	70111
31	28927
32	44257
33	101113
34	152947
35	41941
36	65167
37	41263
38	183301
39	409573
40	150517
41	35803
42	138883
43	81547
44	79693

[7, 13, 193, 271, 157, 193, 1297, 1741, 1231, 1033, 3541, 1447, 727, 2341, 9337, 1747, 9007, 2287, 3307, 14401, 8887, 8161, 8461, 28753, 23623, 23893, 10861, 59233, 70111, 28927, 44257, 101113, 152947, 41941, 65167, 41263, 183301, 409573, 150517, 35803, 138883, 81547, 79693]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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