A292084 - cp's OEIS frontend

A292084 a(n) = least prime p such that 2p + 1 equals (2n - 1)*q where q is a prime, or 0 if no such p exists.

n	a(n)
1	0
2	7
3	7
4	17
5	13
6	71
7	19
8	37
9	59
10	47
11	31
12	149
13	37
14	67
15	43
16	263
17	181
18	227
19	1091
20	97
21	61
22	107
23	67
24	1433
25	73
26	127
27	79
28	137
29	199
30	383
31	701
32	157
33	97
34	167
35	103
36	461
37	109
38	487
39	269
40	197
41	283
42	2531
43	127
44	739
45	311
46	227
47	139
48	617
49	2861
50	643
51	151
52	257
53	157
54	1979
55	163
56	277

[0, 7, 7, 17, 13, 71, 19, 37, 59, 47, 31, 149, 37, 67, 43, 263, 181, 227, 1091, 97, 61, 107, 67, 1433, 73, 127, 79, 137, 199, 383, 701, 157, 97, 167, 103, 461, 109, 487, 269, 197, 283, 2531, 127, 739, 311, 227, 139, 617, 2861, 643, 151, 257, 157, 1979, 163, 277]

cp's OEIS Frontend

A292084 a(n) = least prime p such that 2p + 1 equals (2n - 1)*q where q is a prime, or 0 if no such p exists.

Table of values

List of values

cp's OEIS Frontend

A292084 a(n) = least prime p such that 2*p + 1 equals (2*n - 1)*q where q is a prime, or 0 if no such p exists.

Table of values

List of values

A292084 a(n) = least prime p such that 2p + 1 equals (2n - 1)*q where q is a prime, or 0 if no such p exists.