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.

%I A200655 #17 Mar 31 2012 13:22:09
%S A200655 1,3,5,7,8,19,20,23,96,190,312,400,434,852,980,1063,1208,3960,5464,
%T A200655 6694,7178,13118,13680,18803,27445,28541,42031,73209,83873
%N 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.
%C A200655 a(n) is not so far from p
%C A200655 All certified primes using PFGW64 from primeform group
%Y A200655 Cf. A000043, A121370
%K A200655 nonn
%O A200655 1,2
%A A200655 _Pierre CAMI_, Nov 21 2011

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.

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.