The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109914 Product of all composite numbers k such that n! < k < prime(r) where prime(r-1)< n!. 2
 1, 1, 1, 491400, 3546112878000, 143424700959632400, 10691567972893973348743970911396896000, 210948344078434820704169472200928966427054605885088717074131707385374604732966434908020301638860800000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS k divides n!. 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 LINKS Table of n, a(n) for n=1..8. EXAMPLE a(4) = 25*26*27*28 =491400. MATHEMATICA Table[Product[i, {i, n! + 1, Prime[PrimePi[n! ] + 1] - 1}], {n, 1, 8}] (* Stefan Steinerberger, Mar 14 2006 *) CROSSREFS Cf. A109915. Sequence in context: A359687 A251972 A034629 * A209856 A234822 A082248 Adjacent sequences: A109911 A109912 A109913 * A109915 A109916 A109917 KEYWORD nonn AUTHOR Amarnath Murthy, Jul 16 2005 EXTENSIONS More terms from Stefan Steinerberger, Mar 14 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 09:04 EST 2023. Contains 367701 sequences. (Running on oeis4.)