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 A075070 #7 Dec 05 2013 19:55:36
%S A075070 1,2,4,32,288,576,6912,13824,207360,3317760,59719680,1194393600,
%T A075070 25082265600,50164531200,1203948748800,30098718720000,60197437440000,
%U A075070 1625330810880000,45509262704640000,1365277881139200000
%N A075070 a(n) = n-th compositorial number / (product of those primes which divide the n-th compositorial number).
%C A075070 Smallest integer of the form 'Product of first n composite number/ product of first k primes'.
%C A075070 Divide Compositorial(n) by Primorial(k) choosing k to give the smallest integer. (k+1)-th prime does not divide a(n).
%F A075070 A036691/(prime factors of A036691)
%e A075070 a(0) = 1, a(5) = (4*6*8*9*10)/(2*3*5) = 576, 10 is the fifth composite number.
%t A075070 Composite[n_] := FixedPoint[n + PrimePi[ # ] + 1 &, n + PrimePi[n] + 1]; PrimeFactors[n_] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; Table[ Product[ Composite[i], {i, 1, n}]/ Times @@ PrimeFactors[ Product[ Composite[i], {i, 1, n}]], {n, 0, 20}]
%Y A075070 Cf. A002808.
%K A075070 nonn
%O A075070 0,2
%A A075070 _Amarnath Murthy_, Sep 08 2002
%E A075070 Edited and extended by _Robert G. Wilson v_, Jul 15 2003
%E A075070 Further edited by _N. J. A. Sloane_, Sep 13 2008 at the suggestion of R. J. Mathar