Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093192
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093192 If M(n) is the n-th Mersenne prime, then a(n) is the smallest positive integer such that 2*a(n)*M(n)*M(n+1)*M(n+2)-1 is prime. +0
1
1, 1, 21, 1, 12, 16, 6, 112, 76, 195, 61, 21, 511, 909, 1689, 517, 640, 487, 13615, 12547, 382, 60456 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(3) = 21: M(3) = 2^5-1 = 31; M(4) = 2^7-1 = 127; M(5) = 2^13-1 = 8191; 2*21*31*127*8191-1 = 1354414613, which is prime.

CROSSREFS

Adjacent sequences: A093189 A093190 A093191 this_sequence A093193 A093194 A093195

Sequence in context: A040456 A040457 A040458 this_sequence A040459 A040460 A040461

KEYWORD

nonn

AUTHOR

Ray G. Opao (1260(AT)email.com), Apr 21 2004

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 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research