The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126147 a(n) = floor((Product_{k=1..n-1} prime(k))/prime(n)). 1
 0, 0, 1, 4, 19, 177, 1766, 26868, 421725, 7692857, 208699781, 5420553787, 180993613044, 7075587523888, 278356624078085, 11601694011103611, 552358618257458385, 31520661477937912115, 1750572856110551805720 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Every distinct prime dividing ((Product_{k=1..n-1} prime(k)) (mod prime(n))) also divides a(n). Let Pn(n) = A002110(n) denote the primorial function. The number of natural numbers < Pn(n) that have prime(n+1) as a prime factor is equal to a(n). For example 19 numbers < Pn(4) = 210 have 11 as a prime factor. - Jamie Morken, Sep 18 2018 LINKS Muniru A Asiru, Table of n, a(n) for n = 1..185 MAPLE seq(floor(mul(ithprime(k), k=1..n-1)/ithprime(n)), n=1..20); # Muniru A Asiru, Sep 21 2018 MATHEMATICA f[n_] := Floor[ Product[ Prime@k, {k, n - 1}] / Prime@n]; Array[f, 19] (* Robert G. Wilson v, Mar 07 2007 *) CROSSREFS Cf. A062347, A002110. Sequence in context: A249785 A155804 A292167 * A007411 A276259 A072879 Adjacent sequences:  A126144 A126145 A126146 * A126148 A126149 A126150 KEYWORD nonn AUTHOR Leroy Quet, Mar 07 2007 EXTENSIONS More terms from Robert G. Wilson v, Mar 07 2007 STATUS approved

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 January 20 11:11 EST 2020. Contains 331083 sequences. (Running on oeis4.)