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 A109914 #6 Sep 13 2015 22:06:50
%S A109914 1,1,1,491400,3546112878000,143424700959632400,
%T A109914 10691567972893973348743970911396896000,
%U A109914 210948344078434820704169472200928966427054605885088717074131707385374604732966434908020301638860800000
%N A109914 Product of all composite numbers k such that n! < k < prime(r) where prime(r-1)< n!.
%C A109914 k divides n!.
%C A109914 If n is in A002981, then a(n) is - by definition - 1. If not, then none of the numbers n!+1, n!+2, ... n!+n will be prime, which gives us the lower bound a(n) > (n!+1)^n. - _Stefan Steinerberger_, Mar 14 2006
%e A109914 a(4) = 25*26*27*28 =491400.
%t A109914 Table[Product[i, {i, n! + 1, Prime[PrimePi[n! ] + 1] - 1}], {n, 1, 8}] (* _Stefan Steinerberger_, Mar 14 2006 *)
%Y A109914 Cf. A109915.
%K A109914 nonn
%O A109914 1,4
%A A109914 _Amarnath Murthy_, Jul 16 2005
%E A109914 More terms from _Stefan Steinerberger_, Mar 14 2006