This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A309772 #28 Sep 08 2022 08:46:22 %S A309772 12,12,24,24,84,126,180,120,120,480,608,798,924,528,432,540,1860,2108, %T A309772 1224,2664,2960,1680,1260,4410,4998,5304,2808,5940,6270,7296,4224, %U A309772 3036,9660,2100,11400,12008,12956,6888,4872,5220,16380,17472,18624,19206,19800,10600 %N A309772 Least common multiple of prime(n+1)+1 and prime(n)+1. %C A309772 a(n) = (prime(n)+1)*(prime(n+1)+1)/2 if n is in A066940. - _Robert Israel_, Aug 16 2019 %H A309772 Daniel Hoyt, <a href="/A309772/b309772.txt">Table of n, a(n) for n = 1..1000</a> %F A309772 a(n) = lcm(A008864(n+1), A008864(n)) = lcm(prime(n+1)+1, prime(n)+1). %p A309772 P:= [seq(ithprime(i),i=1..100)]: %p A309772 seq(ilcm(P[i]+1,P[i+1]+1),i=1..99); # _Robert Israel_, Aug 16 2019 %t A309772 Array[LCM[Prime[#] + 1, Prime[# + 1] + 1] &, 50] (* _Amiram Eldar_, Aug 16 2019 *) %o A309772 (Magma) [Lcm(1+NthPrime(n),1+NthPrime(n+1)):n in [1..50]]; // _Marius A. Burtea_, Aug 16 2019 %Y A309772 Cf. A008864, A063086 (gcd), A066940, A180617 (product). %K A309772 nonn,look %O A309772 1,1 %A A309772 _Daniel Hoyt_, Aug 16 2019