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!)
A309772 Least common multiple of prime(n+1)+1 and prime(n)+1. 1

%I #28 Sep 08 2022 08:46:22

%S 12,12,24,24,84,126,180,120,120,480,608,798,924,528,432,540,1860,2108,

%T 1224,2664,2960,1680,1260,4410,4998,5304,2808,5940,6270,7296,4224,

%U 3036,9660,2100,11400,12008,12956,6888,4872,5220,16380,17472,18624,19206,19800,10600

%N Least common multiple of prime(n+1)+1 and prime(n)+1.

%C a(n) = (prime(n)+1)*(prime(n+1)+1)/2 if n is in A066940. - _Robert Israel_, Aug 16 2019

%H Daniel Hoyt, <a href="/A309772/b309772.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = lcm(A008864(n+1), A008864(n)) = lcm(prime(n+1)+1, prime(n)+1).

%p P:= [seq(ithprime(i),i=1..100)]:

%p seq(ilcm(P[i]+1,P[i+1]+1),i=1..99); # _Robert Israel_, Aug 16 2019

%t Array[LCM[Prime[#] + 1, Prime[# + 1] + 1] &, 50] (* _Amiram Eldar_, Aug 16 2019 *)

%o (Magma) [Lcm(1+NthPrime(n),1+NthPrime(n+1)):n in [1..50]]; // _Marius A. Burtea_, Aug 16 2019

%Y Cf. A008864, A063086 (gcd), A066940, A180617 (product).

%K nonn,look

%O 1,1

%A _Daniel Hoyt_, Aug 16 2019

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 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)