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!)
A093490 a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) - 1. 3

%I #20 Mar 16 2024 18:57:09

%S 2,3,5,29,347,3469,41627,1748333,27973327,1007039771,70492783969,

%T 7754206236589,2605413295493903,6503111585552781887,

%U 4825308796480164160153,1881870430627264022459669

%N a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) - 1.

%H Harvey P. Dale, <a href="/A093490/b093490.txt">Table of n, a(n) for n = 0..200</a>

%e a(3) = 29, a(4) = 3*4*29 - 1 = 347.

%t nxt[{n_,a_}]:=Module[{k=1},While[!PrimeQ[k(n+1)a-1],k++];{n+1, k(n+1)a- 1}]; NestList[nxt,{0,2},20][[All,2]] (* _Harvey P. Dale_, Feb 27 2020 *)

%o (PARI) v=[2]; for(n=2,20,k=1; while(!isprime(p=k*(n-1)*v[n-1]-1), k++); v=concat(v,p)); v \\ _Rick L. Shepherd_, Jan 31 2005

%Y Cf. A103342 (corresponding k values), A091771, A091879.

%K nonn

%O 0,1

%A _Amarnath Murthy_, Apr 16 2004

%E More terms from _Rick L. Shepherd_ and _Ryan Propper_, Jan 31 2005

%E Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, May 14 2007

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 24 05:49 EDT 2024. Contains 371918 sequences. (Running on oeis4.)