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!)
A075342 a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive. 1

%I #14 Dec 05 2013 19:55:37

%S 1,3,8,18,32,54,80,110,158,200,264,332,402,480,578,662,774,888,1022,

%T 1154,1298,1460,1610,1788,1994,2162,2378,2610,2798,3042,3314,3548,

%U 3804,4080,4364,4664,4988,5310,5648,5954,6312,6690,7028,7482,7842,8264,8690

%N a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.

%C 3 is the only prime member, a(3) onwards a(n)-1 is prime.

%t Join[{1,3},Rest[(Prime[#]+1)&/@Table[(n(n+1))/2+1,{n,50}]]] (* _Harvey P. Dale_, Jul 25 2011 *)

%o (PARI) a(n)=if(n<3,[1,3][n],prime(n*(n-1)/2+1)+1) \\ _Charles R Greathouse IV_, Jul 24 2011

%Y Cf. A075343.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Sep 18 2002

%E More terms from _Sascha Kurz_, Jan 30 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 23 02:23 EDT 2024. Contains 371906 sequences. (Running on oeis4.)