The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A068902 Least multiple of n not less than the n-th prime. 4

%I #18 Sep 08 2022 08:45:05

%S 2,4,6,8,15,18,21,24,27,30,33,48,52,56,60,64,68,72,76,80,84,88,92,96,

%T 100,104,108,112,116,120,155,160,165,170,175,180,185,190,195,200,205,

%U 210,215,220,225,230,235,240,245,250,255,260

%N Least multiple of n not less than the n-th prime.

%H Robert Israel, <a href="/A068902/b068902.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A000040(n) + A068901(n).

%F a(n) = n*ceiling(prime(n)/n). - _Vladeta Jovovic_, Apr 06 2003

%p seq(n*ceil(ithprime(n)/n),n=1..60); # _Robert Israel_, Feb 27 2017

%t Table[n Ceiling[Prime@ n/n], {n, 60}] (* _Michael De Vlieger_, Feb 27 2017 *)

%o (PARI) vector(60, n, n*ceil(prime(n)/n) ) \\ _G. C. Greubel_, Jun 09 2019

%o (Magma) [n*Ceiling(NthPrime(n)/n): n in [1..60]]; // _G. C. Greubel_, Jun 09 2019

%o (Sage) [n*ceil(nth_prime(n)/n) for n in (1..60)] # _G. C. Greubel_, Jun 09 2019

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Mar 05 2002

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 May 28 12:54 EDT 2024. Contains 372913 sequences. (Running on oeis4.)