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

 

Logo
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

%I #5 Mar 16 2015 22:33:43

%S 0,7,3,5,7,14639,11,13,24137567,17,19,

%T 480250763996501976790165756943039,23,727,839,29,31,1223,1367,37,

%U 2825759,41,43,2207,47,45767944570399,7890479,53,1176246293903439667999,12117359,59,61,318644812890623

%N a(n) = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists.

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

%Y Cf. A084712, A084713.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Jun 10 2003

%E Edited, corrected and extended by _Robert G. Wilson v_, Jun 11 2003

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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)