The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089159 If Mersenne numbers have 3 or more factors, then list the third factor. 0

%I

%S 2089,2099863,13264529,20394401,212885833,9361973132609,1113491139767,

%T 65993,165799,1654058017289,110211473,70084436712553223,

%U 1489459109360039866456940197095433721664951999121,7648337,39940132241

%N If Mersenne numbers have 3 or more factors, then list the third factor.

%H Chris Caldwell, <a href="http://primes.utm.edu/mersenne/index.html">MersenneNumbers History</a>.

%F A Mersenne number (A001348) is a number of the form 2^p - 1 where p is prime.

%e The 10th Mersenne number 2^29 - 1 = 233*1103*2089 and 2089 is the third prime factor. Notice these factors are congruent 1( mod 29 ).

%o (PARI) mersenne2(n) = { c=0; forprime(x=2, n, c++; y = 2^x-1; f=ifactor(y); if(length(f)>=3, print1(f","); ) ) } ifactor(n) = \The vector of the integer factors of n with multiplicity. { local(f,j,k,flist); flist=[]; f=Vec(factor(n)); for(j=1,length(f), for(k = 1,f[j],flist = concat(flist,f[j]) ); ); return(flist) }

%Y Cf. A016047.

%K easy,nonn

%O 1,1

%A _Cino Hilliard_, Dec 06 2003, corrected Nov 16 2006

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

Last modified January 28 06:29 EST 2020. Contains 331317 sequences. (Running on oeis4.)