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 A058255 #12 Dec 07 2018 07:53:41
%S A058255 1,2,4,12,60,240,720,7920,55440,1275120,16576560,480720240,
%T A058255 19709529840,39419059680,197095298400,3350620072800,177582863858400,
%U A058255 532748591575200,19711697888282400,59135093664847200
%N A058255 Distinct values of lcm_{i=1..n} (p(i)-1), where p() are the primes.
%C A058255 The prime A095365(n) is the least prime yielding an LCM of a(n). This sequence and A095365 are related to A095366. - _T. D. Noe_, Jun 04 2004
%H A058255 Michael De Vlieger, <a href="/A058255/b058255.txt">Table of n, a(n) for n = 1..360</a>
%e A058255 For p = 29, 31, 37, 41, 43 these LCMs are equal to 55440 = 11*7! = lcm[1, 2, 4, 6, 10, 12, 16, 22, 28, 30, 36, 40, 42] = lcm[1, 2, 4, 6, 10, 12, 16, 22, 28]. The values was put on the stage only once. Repetitions skipped.
%t A058255 Union@ Table[LCM @@ (Prime@ Range[1, n] - 1), {n, 38}] (* _Michael De Vlieger_, Dec 06 2018 *)
%Y A058255 A058254 with duplicates removed.
%Y A058255 Cf. A002110, A005867, A003418, A054451, A000142, A000010.
%Y A058255 Cf. A095366 (least k > 1 such that k divides 1^n + 2^n + ... + (k-1)^n).
%K A058255 nonn
%O A058255 1,2
%A A058255 _Labos Elemer_, Dec 06 2000