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!)
A060357 a(n) = smallest prime > lcm(1..n). 5

%I #16 Sep 08 2022 08:45:03

%S 2,2,3,7,13,61,61,421,853,2521,2521,27733,27733,360391,360391,360391,

%T 720743,12252259,12252259,232792561,232792561,232792561,232792561,

%U 5354228921,5354228921,26771144401,26771144401,80313433231,80313433231,2329089562843,2329089562843

%N a(n) = smallest prime > lcm(1..n).

%H Vincenzo Librandi, <a href="/A060357/b060357.txt">Table of n, a(n) for n = 0..500</a>

%F a(n) = A151800(A003418(n)). - _Michel Marcus_, Mar 20 2018

%p [seq(nextprime(A003418(n)), n=0..60)];

%t Join[{2}, Table[NextPrime[LCM@@Range[n], 1], {n, 1, 30}]] (* _Vincenzo Librandi_, Mar 20 2018 *)

%o (PARI) a(n) = nextprime(lcm([1..n])+1); \\ _Michel Marcus_, Mar 18 2018

%o (Magma) [NextPrime(Lcm([1..n])): n in [0..30]]; // _Vincenzo Librandi_, Mar 20 2018

%Y Cf. A003418, A151800.

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Apr 01 2001

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 6 02:22 EDT 2024. Contains 372290 sequences. (Running on oeis4.)