Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098566 Smallest prime P such that P# - Mersenne-prime(n) is prime. +0
3
3, 5, 7, 7, 13, 17, 19, 29, 53, 157, 79, 101, 613, 641, 2633, 2161, 1697, 2293, 12251, 4283, 7573, 7243, 9433, 22381, 29411, 16333 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

mexp = {the list in A000043}; Primorial[n_] := Product[ Prime[i], {i, n}]; f[n_] := Block[{k = 1}, While[Primorial[k] < 2^mexp[[n]] || !PrimeQ[ Primorial[k] - 2^mexp[[n]] + 1], k++ ]; Prime[k]]; Table[ f[n], {n, 15}] (from Robert G. Wilson v Sep 28 2004)

CROSSREFS

Cf. A098567.

Sequence in context: A084752 A037464 A060265 this_sequence A006540 A099726 A131979

Adjacent sequences: A098563 A098564 A098565 this_sequence A098567 A098568 A098569

KEYWORD

more,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Sep 15 2004

EXTENSIONS

Corrected by Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 28 2004

a(19)-a(26) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 22 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research