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 A060361 #12 Mar 19 2018 05:41:56
%S A060361 1,1,1,1,1,1,1,1,13,1,1,13,13,31,31,31,23,19,19,1,1,1,1,41,41,1,1,31,
%T A060361 31,43,43,1,41,41,41,41,41,53,53,53,53,79,79,59,59,59,59,1,1,59,59,59,
%U A060361 59,61,61,61,61,61,61,113,113,97,97,97,179,179,179,73
%N A060361 a(n) = { Smallest prime > k } - k, where k = lcm(1..n).
%t A060361 f[n_]:=Module[{lcm=LCM@@Range[n]},NextPrime[lcm]-lcm]; Join[{1}, Array[f,70]] (* _Harvey P. Dale_, May 20 2011 *)
%o A060361 (PARI) a(n) = my(lc = lcm([1..n])); nextprime(lc+1) - lc; \\ _Michel Marcus_, Mar 18 2018
%K A060361 nonn
%O A060361 0,9
%A A060361 _N. J. A. Sloane_, Apr 01 2001