Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098920
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098920 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, 6, 30, 10, 4, 26, 12, 10, 12, 436, 644, 424, 2164, 862, 408, 9558, 5226, 12350 (list; graph; listen)
OFFSET

1,1

EXAMPLE

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

CROSSREFS

Adjacent sequences: A098917 A098918 A098919 this_sequence A098921 A098922 A098923

Sequence in context: A058756 A007039 A025248 this_sequence A129365 A021453 A053789

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research