login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084714 a(n) = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists. 16
0, 7, 3, 5, 7, 14639, 11, 13, 24137567, 17, 19, 480250763996501976790165756943039, 23, 727, 839, 29, 31, 1223, 1367, 37, 2825759, 41, 43, 2207, 47, 45767944570399, 7890479, 53, 1176246293903439667999, 12117359, 59, 61, 318644812890623 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..33.

MATHEMATICA

f[n_] := Block[{k = 1}, While[ !PrimeQ[(2*n - 1)^k - 2], k++ ]; (2*n - 1)^k - 2]; Table[ f[n], {n, 2, 34}]

CROSSREFS

Cf. A084712, A084713.

Sequence in context: A135002 A319531 A175452 * A340820 A256779 A030760

Adjacent sequences: A084711 A084712 A084713 * A084715 A084716 A084717

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Jun 10 2003

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v, Jun 11 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 28 19:31 EST 2022. Contains 359109 sequences. (Running on oeis4.)