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!)
A135434 a(n) is the smallest odd number that makes a(n)*2^N(n)-1 prime, where N(n) is the n-th Mersenne number that makes 2^N(n)-1 prime. 2

%I #14 Apr 03 2023 10:36:11

%S 3,3,7,3,9,7,51,15,69,19,25,103,1905,273,139,13,4027,3619,2187,3211,

%T 6621,1897,17461,2511,90579,30189,805,86539,30091,317917,198681,

%U 755061,1283911,26869,1564347,4348099,383731,6020095

%N a(n) is the smallest odd number that makes a(n)*2^N(n)-1 prime, where N(n) is the n-th Mersenne number that makes 2^N(n)-1 prime.

%C First 22 terms are obtained by Mathematica. Terms from 23 to 38 are obtained by Jean Penna's LLR program.

%H Jean Penna, <a href="https://t5k.org/bios/page.php?id=431">LLR</a>.

%H Lei Zhou, <a href="https://t5k.org/bios/page.php?id=1273">Prime page</a>

%e First Mersenne number N(1)=2, 2^2-1=3 is the first Mersenne prime. 3*2^2-1=11 is prime;

%e Fifth Mersenne number N(5)=13, 2^13-1=8191 is the fifth Mersenne prime. 9*2^13-1=73727 is prime.

%Y Cf. A000043.

%K nonn,hard,more

%O 1,1

%A _Lei Zhou_, Dec 13 2007

%E a(35)-a(37) from _Pierre CAMI_, Apr 06 2015

%E a(38) from _Lei Zhou_, Sep 04 2022

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 May 3 08:32 EDT 2024. Contains 372207 sequences. (Running on oeis4.)