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!)
A174741 a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime. 0

%I #3 Mar 30 2012 19:00:43

%S 4,8,18,17,29,87,79,70,58,292,506,424,766,937,542,2026,1820,2842,4960,

%T 5215,2136,4687,4461,12809,13992,3666,16231,17662,17338,41935,60010,

%U 46063,61469,144060,114441,137956,293037,290348,443629,457617,264395

%N a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.

%p a:=proc(n) local m,p; p:=ithprime(n); for m from 2 do if nextprime(p*m)>p*(m+1) then return m; fi; od: end proc:

%Y Cf. A110835

%K hard,nonn

%O 1,1

%A _W. Edwin Clark_, Mar 29 2010

%E Terms from a(37) on from _R. J. Mathar_, Apr 15 2010

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 08:28 EDT 2024. Contains 371927 sequences. (Running on oeis4.)