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 A058017 #16 Aug 13 2024 05:29:54
%S A058017 2,3,7,13,61,421,853,2521,27733,360391,720743,12252259,232792561,
%T A058017 5354228921,26771144401,80313433231,2329089562843,72201776446801,
%U A058017 144403552893641,5342931457063253,219060189739591279,9419588158802421659,442720643463713815201,3099044504245996706459
%N A058017 a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).
%C A058017 For the first 100 prime powers, the difference between a(n) and the LCM is either 1 or a prime.
%C A058017 The values of x are taken to be prime powers so that each distinct LCM occurs exactly once.
%F A058017 a(n) = A151800(A051451(n)) = A051451(n) + A058018(n). - _Amiram Eldar_, Aug 13 2024
%e A058017 The 6th distinct prime power is A000961(7) = 8, LCM(1,...,8) = 840 and 853 is the first prime that follows, thus a(7) = 853.
%t A058017 With[{max = 50}, NextPrime[Exp[Accumulate[Join[{0}, Select[Array[MangoldtLambda, max], # > 0 &]]]]]] (* _Amiram Eldar_, Aug 13 2024 *)
%o A058017 (PARI) lista(nn) = {for (n=1, nn, if ((n==1) || isprimepower(n), print1(nextprime(lcm(vector(n, x, x)) + 1), ", ")));} \\ _Michel Marcus_, Apr 09 2015
%Y A058017 Cf. A000961, A003418, A051451, A058018, A151800.
%K A058017 nonn
%O A058017 1,1
%A A058017 _Labos Elemer_, Nov 14 2000
%E A058017 Edited by _Franklin T. Adams-Watters_, Aug 15 2006
%E A058017 Offset changed to 1 and more terms from _Michel Marcus_, Apr 09 2015
%E A058017 Name corrected by _Amiram Eldar_, Aug 13 2024