A157884 - cp's OEIS frontend

A157884 For each positive integer m there exist at least one prime Q=Q(m) and at least one prime P=P(m) such that (2m-1)^2 < Q < (2m)^2 - (2m-1) <= P < (2m)^2. Sequence lists pairs P(m), Q(m) for m >= 1. If more than one prime for P or Q exists, we take the smallest.

n	a(n)
1	2
2	3
3	11
4	13
5	29
6	31
7	53
8	59
9	83
10	97
11	127
12	137
13	173
14	191
15	227
16	241
17	293
18	307
19	367
20	383
21	443
22	463
23	541
24	557
25	631
26	653
27	733
28	757
29	853
30	877
31	967
32	997
33	1091
34	1123
35	1229
36	1277
37	1373
38	1409
39	1523
40	1567
41	1693
42	1723
43	1861
44	1901
45	2027
46	2081
47	2213
48	2267
49	2411
50	2459

[2, 3, 11, 13, 29, 31, 53, 59, 83, 97, 127, 137, 173, 191, 227, 241, 293, 307, 367, 383, 443, 463, 541, 557, 631, 653, 733, 757, 853, 877, 967, 997, 1091, 1123, 1229, 1277, 1373, 1409, 1523, 1567, 1693, 1723, 1861, 1901, 2027, 2081, 2213, 2267, 2411, 2459]

cp's OEIS Frontend

A157884 For each positive integer m there exist at least one prime Q=Q(m) and at least one prime P=P(m) such that (2m-1)^2 < Q < (2m)^2 - (2m-1) <= P < (2m)^2. Sequence lists pairs P(m), Q(m) for m >= 1. If more than one prime for P or Q exists, we take the smallest.

Table of values

List of values