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!)
A263686 Smallest prime factor of double Mersenne numbers. 3
7, 127, 2147483647, 170141183460469231731687303715884105727, 338193759479, 231733529, 62914441, 295257526626031 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A double Mersenne number is a Mersenne number of the form 2^(2^p - 1) - 1, where p is a Mersenne exponent (A000043).
LINKS
Double Mersennes Prime Search, History
PROG
(PARI) forprime(p=2, , q=2^p-1; !ispseudoprime(q) && next(); if(ispseudoprime(2^q-1), print1(2^q-1, ", "); next()); forstep(r=2*q+1, +oo, 2*q, !ispseudoprime(r) && next(); if(Mod(2, r)^q-1 == 0, print1(r, ", "); next(2)))) \\ Jeppe Stig Nielsen, Aug 28 2019
CROSSREFS
Cf. A000043, A000668, A077586, A122094. Subsequence of A016047. Subsequence of A309130.
Sequence in context: A077586 A277634 A309130 * A002614 A333561 A187237
Adjacent sequences: A263683 A263684 A263685 * A263687 A263688 A263689
KEYWORD
nonn,hard,more
AUTHOR
Arkadiusz Wesolowski, Oct 23 2015
STATUS
approved



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 July 22 10:19 EDT 2024. Contains 374490 sequences. (Running on oeis4.)