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 A075367 #12 Mar 18 2018 04:11:15
%S A075367 1,12,60,30,2520,2520,360360,180180,60060,60060,232792560,232792560,
%T A075367 26771144400,26771144400,26771144400,13385572200,144403552893600,
%U A075367 144403552893600,5342931457063200,5342931457063200,5342931457063200
%N A075367 Smallest value of lcm(n+1, n+2, ..., n+k) (for k >= 0) that is divisible by the product of all the primes up to n.
%H A075367 T. D. Noe, <a href="/A075367/b075367.txt">Table of n, a(n) for n = 1..200</a>
%F A075367 a(n) = lcm(n+1, ..., n + A075365(n)).
%t A075367 a75365[n_] := Module[{div, k, pr}, div=Times@@Prime/@Range[PrimePi[n]]; For[k=0; pr=1, True, k++; pr*=n+k, If[Mod[pr, div]==0, Return[k]]]]; a[1]=1; a[n_] := LCM@@Range[n+1, n+a75365[n]]
%Y A075367 Cf. A075365, A075366, A075368.
%K A075367 nice,nonn
%O A075367 1,2
%A A075367 _Amarnath Murthy_, Sep 20 2002
%E A075367 Edited by _Dean Hickerson_, Oct 28 2002