login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098919 Least k such that k*M#(n) - 1 is prime where M#(n) is the product of the first n Mersenne primes. 0

%I #9 Dec 27 2019 09:56:04

%S 2,2,2,16,2,24,8,66,6,38,44,142,116,20,460,2974,5774,1110,2520,3422

%N Least k such that k*M#(n) - 1 is prime where M#(n) is the product of the first n Mersenne primes.

%e 2*(2^2-1)*(2^3-1)*(2^5-1) - 1 = 1301, which is prime, so k(3)=2.

%K hard,more,nonn

%O 1,1

%A _Pierre CAMI_, Oct 17 2004

%E a(15)-a(20) from _Donovan Johnson_, Mar 23 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)