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 A083551 #20 Oct 11 2020 14:00:14
%S A083551 2,2,4,4,4,4,4,12,6,6,12,4,4,12,6,6,6,12,4,6,12,12,24,8,4,4,4,4,28,28,
%T A083551 12,6,10,10,6,6,12,12,6,6,10,10,4,4,12,12,12,4,4,12,6,10,30,6,6,6,6,
%U A083551 12,4,10,70,28,4,4,28,42,30,10,4,12,24,24,6,12,12,24,8,8,40,10,10,10,6,12
%N A083551 Least common multiple of 2 consecutive prime differences, of two successive terms of A001223.
%H A083551 Vincenzo Librandi, <a href="/A083551/b083551.txt">Table of n, a(n) for n = 1..10000</a>
%F A083551 a(n) = lcm(A001223(n), A001223(n+1)).
%t A083551 f[x_] := Prime[x+1]-Prime[x]; Table[LCM[f[w+1], f[w]], {w, 1, 128}]
%t A083551 Table[LCM[(Prime[n + 1] - Prime[n]), Prime[n + 2] - Prime[n + 1]], {n, 100}] (* _Vincenzo Librandi_, Mar 15 2018 *)
%t A083551 LCM@@#&/@Partition[Differences[Prime[Range[90]]],2,1] (* _Harvey P. Dale_, Oct 11 2020 *)
%Y A083551 Cf. A001223, A083538..A083555, A057467.
%K A083551 nonn
%O A083551 1,1
%A A083551 _Labos Elemer_, May 22 2003