Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139430
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139430 Smallest prime p such that M(n)^2+p*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n). +0
8
3, 5, 11, 5, 11, 11, 17, 19, 23, 97, 127, 1009, 167, 269, 953, 479, 3307, 1453, 37507, 2357, 599, 17669, 5527, 3191, 3251, 70249, 147773 (list; graph; listen)
OFFSET

1,1

COMMENT

All primes certified using openpfgw_v12 from primeform group

EXAMPLE

3*3+3*3-1=17 prime 3=M(1)=2^2-1 so p(1)=3

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

31*31+11*31-1=1301 prime 31=M(3)=2^5-1 so p(3)=11

CROSSREFS

Cf. A000668, A139424, A139425, A139426, A139427, A139428, A139429, A139431.

Adjacent sequences: A139427 A139428 A139429 this_sequence A139431 A139432 A139433

Sequence in context: A060955 A024329 A064523 this_sequence A143386 A137656 A046228

KEYWORD

hard,more,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Apr 21 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research