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!)
A139428 Smallest prime p such that M(n)^2-p*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n). 7
5, 7, 5, 17, 43, 67, 41, 53, 311, 317, 317, 43, 1427, 37, 25693, 563, 17239, 911, 11497, 112247, 1259, 190639, 138569, 296713, 27733, 11777 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
All primes certified using openpfgw_v12 from primeform group
LINKS
EXAMPLE
7*7-5*7-1=13 prime 7=M(2)=2^3-1 so k(2)=5;
31*31-7*31-1=743 prime 31=M(3)=2^5-1 so k(3)=7.
MATHEMATICA
A000043 = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011, 24036583, 25964951, 30402457, 32582657, 37156667, 42643801, 43112609};
Table[m = 2^A000043[[n]] - 1; m2 = m^2; p = 1;
While[! PrimeQ[m2 - Prime[p]*m - 1], p++];
Prime[p], {n, 15}] (* Robert Price, Apr 17 2019 *)
CROSSREFS
Sequence in context: A226660 A125294 A177735 * A303574 A063005 A329763
KEYWORD
hard,more,nonn
AUTHOR
Pierre CAMI, Apr 21 2008
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)