Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098919
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098919 Least k such that k*M#(n) -1 is prime with M#(n)=product from 1 to n of Mersenne-primes. +0
1
2, 2, 2, 16, 2, 24, 8, 66, 6, 38, 44, 142, 116, 20, 460, 2974, 5774, 1110, 2520, 3422 (list; graph; listen)
OFFSET

1,1

EXAMPLE

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

CROSSREFS

Sequence in context: A129409 A025521 A068218 this_sequence A079007 A087238 A099640

Adjacent sequences: A098916 A098917 A098918 this_sequence A098920 A098921 A098922

KEYWORD

hard,more,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Oct 17 2004

EXTENSIONS

a(15)-a(20) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Mar 23 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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research