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!)
A132192 Least number k such that 4*(k*(2^p-1))^2 + 1 is prime where 2^p-1 is a Mersenne prime (p in A000043). 0

%I #7 Jul 17 2021 11:21:56

%S 1,1,2,6,40,17,4,6,47,48,334,99,585,19,350,1201,197,3577,2020,870,

%T 2322,4488,6150,12397,7817

%N Least number k such that 4*(k*(2^p-1))^2 + 1 is prime where 2^p-1 is a Mersenne prime (p in A000043).

%e a(1) = 1 since 3 = 2^A000043(1) - 1 and 4*(1*3)^2 + 1 = 37 is prime.

%t f[n_] := Module[{k = 1}, While[!PrimeQ[4*(k*n)^2 + 1], k++]; k]; f /@ (2^MersennePrimeExponent[Range[15]] - 1)(* _Amiram Eldar_, Jul 17 2021 *)

%Y Cf. A000043, A000668.

%K nonn,more

%O 1,3

%A _Pierre CAMI_, Nov 05 2007

%E Data corrected and a(23)-a(25) added by _Amiram Eldar_, Jul 17 2021

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 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)