The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239548 Primes p such that gcd(Lucas(p), Mersenne(p)) > 1. 1

%I

%S 2,179,239,359,419,487,659,719,883,1013,1019,1439,1459,1499,1559,1723,

%T 1871,1993,2039,2339,2399,2459,2593,2699,2819,2939,3041,3299,3329,

%U 3359,3539,3779,4019,4813,4919,4957,5039,5231,5261,5279,5399,5639,6011,6353,6373

%N Primes p such that gcd(Lucas(p), Mersenne(p)) > 1.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LucasNumber.html">Lucas Number</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MersenneNumber.html">Mersenne Number</a>

%e 239 is in the sequence since it is prime and 479 is a prime factor of both Lucas(239) and Mersenne(239) = 2^239 - 1.

%o (MAGMA) [p: p in PrimesUpTo(6500) | Gcd(Lucas(p),2^p-1) gt 1];

%o (PARI) for(p=2, 6373, if(isprime(p)&&gcd(fibonacci(p-1)+fibonacci(p+1), 2^p-1)>1, print1(p, ", ")));

%Y Supersequence of A230809.

%Y Cf. A000032, A001348.

%K nonn

%O 1,1

%A _Arkadiusz Wesolowski_, Mar 21 2014

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 22 13:41 EST 2020. Contains 331149 sequences. (Running on oeis4.)