Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098917 Least k such that k*Mersenne-prime(n)*Mersenne-prime(n+1) + 1 is prime. +0
1
2, 6, 4, 16, 36, 6, 42, 24, 172, 18, 52, 54, 6, 130 (list; graph; listen)
OFFSET

1,1

EXAMPLE

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

2*(2^3-1)*(2^5-1) + 1 = 435 composite

4*(2^3-1)*(2^5-1) + 1 = 867 composite

6*(2^3-1)*(2^5-1) + 1 = 1303 prime so k(2)=6

CROSSREFS

Adjacent sequences: A098914 A098915 A098916 this_sequence A098918 A098919 A098920

Sequence in context: A110346 A095754 A127320 this_sequence A054786 A033457 A133936

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Oct 17 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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research