This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112141 Product of the first n semiprimes. 18
 4, 24, 216, 2160, 30240, 453600, 9525600, 209563200, 5239080000, 136216080000, 4495130640000, 152834441760000, 5349205461600000, 203269807540800000, 7927522494091200000, 364666034728195200000, 17868635701681564800000, 911300420785759804800000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Semiprime analog of primorial (A002110). Equivalent for product of what A062198 is for sum. Bigomega(a(n)) = the number of not necessarily distinct prime factors of a(n) = A001222(a(n)) = A005843(n) = 2*n. LINKS T. D. Noe, Table of n, a(n) for n = 1..100 FORMULA a(n) = prod_{i=1..n} A001358(i). EXAMPLE a(10) = 4*6*9*10*14*15*21*22*25*26 = 136216080000, the product of the first 10 semiprimes. MATHEMATICA NextSemiPrime[n_, k_: 1] := Block[{c = 0, sgn = Sign[k]}, sp = n + sgn; While[c < Abs[k], While[ PrimeOmega[sp] != 2, If[sgn < 0, sp--, sp++]]; If[sgn < 0, sp--, sp++]; c++]; sp + If[sgn < 0, 1, -1]]; f[n_] := Times @@ NestList[ NextSemiPrime@# &, 2^2, n - 1]; Array[f, 18] (* Robert G. Wilson v, Jun 13 2013 *) PROG (PARI) a(n)=my(v=vector(n), i, k=3); while(i

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

Last modified December 17 14:50 EST 2018. Contains 318201 sequences. (Running on oeis4.)