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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139426 Smallest number k such that M(n)^2+k*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n). 7
1, 5, 1, 5, 11, 11, 17, 19, 23, 97, 127, 145, 167, 269, 767, 479, 3307, 1453, 18007, 2357, 599, 17669, 5527, 3191, 3251 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

All primes certified using openpfgw_v12 from primeform group

EXAMPLE

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

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

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

CROSSREFS

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

Sequence in context: A128359 A170903 A131113 * A143384 A046611 A145825

Adjacent sequences:  A139423 A139424 A139425 * A139427 A139428 A139429

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 17 11:46 EST 2012. Contains 206011 sequences.