A200655 - cp's OEIS frontend

A200655 a(n)= least number k > a(n-1) such that k(2^p-1)(k*(2^p-1)+1)-1 is prime, where p = A000043(n) = Mersenne exponents.

n	a(n)
1	1
2	3
3	5
4	7
5	8
6	19
7	20
8	23
9	96
10	190
11	312
12	400
13	434
14	852
15	980
16	1063
17	1208
18	3960
19	5464
20	6694
21	7178
22	13118
23	13680
24	18803
25	27445
26	28541
27	42031
28	73209
29	83873

[1, 3, 5, 7, 8, 19, 20, 23, 96, 190, 312, 400, 434, 852, 980, 1063, 1208, 3960, 5464, 6694, 7178, 13118, 13680, 18803, 27445, 28541, 42031, 73209, 83873]

cp's OEIS Frontend

A200655 a(n)= least number k > a(n-1) such that k(2^p-1)(k*(2^p-1)+1)-1 is prime, where p = A000043(n) = Mersenne exponents.

Table of values

List of values

cp's OEIS Frontend

A200655 a(n)= least number k > a(n-1) such that k*(2^p-1)*(k*(2^p-1)+1)-1 is prime, where p = A000043(n) = Mersenne exponents.

Table of values

List of values

A200655 a(n)= least number k > a(n-1) such that k(2^p-1)(k*(2^p-1)+1)-1 is prime, where p = A000043(n) = Mersenne exponents.