A210476 - cp's OEIS frontend

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

n	a(n)
2	7
3	67
4	43
5	67
6	67
7	191
8	883
9	43
10	643
11	379
12	739
13	103
14	463
15	643
16	487
17	883
18	1303
19	3847
20	1447
21	13963
22	1087
23	8863
24	1999
25	8167
26	7687
27	8443
28	2707
29	2203
30	11083
31	3463
32	7687
33	31387
34	8419
35	15919
36	12979
37	10099
38	26683
39	22027
40	46687
41	79687
42	15439
43	65839
44	46723
45	44683
46	14887
47	58963
48	13879
49	26947
50	77587

[7, 67, 43, 67, 67, 191, 883, 43, 643, 379, 739, 103, 463, 643, 487, 883, 1303, 3847, 1447, 13963, 1087, 8863, 1999, 8167, 7687, 8443, 2707, 2203, 11083, 3463, 7687, 31387, 8419, 15919, 12979, 10099, 26683, 22027, 46687, 79687, 15439, 65839, 46723, 44683, 14887, 58963, 13879, 26947, 77587]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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