login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139424 Smallest number k such that M(n)^2-k*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n). 7
1, 1, 1, 1, 1, 43, 1, 41, 53, 91, 317, 317, 43, 1, 37, 3595, 563, 17239, 911, 11497, 58501, 1259, 10283, 138569, 72247, 27733 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

All primes certified using openpfgw_v12 from primeform group

EXAMPLE

3*3-1*3-1=5 prime 3=M(1)=2^2-1 so k(1)=1

7*7-1*7-1=41 prime 7=M(2)=2^3-1 so k(2)=1

31*31-1*31-1=929 prime 31=M(3)=2^5-1 so k(3)=1

CROSSREFS

Cf. A000668, A139425, A139426, A139427, A139428, A139429, A139430, A139421.

Sequence in context: A070177 A173866 A114786 * A051318 A036202 A107814

Adjacent sequences:  A139421 A139422 A139423 * A139425 A139426 A139427

KEYWORD

hard,more,nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Apr 21 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.