login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A135568
a(n) = floor( Product_{i=1..n} prime(i)/i ).
3
1, 2, 3, 5, 8, 19, 41, 101, 240, 614, 1782, 5024, 15492, 48859, 150069, 470216, 1557591, 5405758, 18319515, 64600395, 229331402, 797199637, 2862671427, 10330509932, 38308974332, 148638820408
OFFSET
0,2
COMMENTS
Does there exist an n such that (the product of the first n primes)/n! is an integer for n>3?
The answer to the question above is obviously no: for n>3 the denominator is a multiple of 4. - Emeric Deutsch, Mar 14 2008
Product_{i=1..n} (p_i/i) is the volume of the n-dimensional simplex with its n+1 vertices at (0, 0, 0, ..., 0), (p_1, 0, 0, ..., 0), (0, p_2, 0, ..., 0), (0, 0, p_3, ..., 0), ..., (0, 0, 0, ..., p_n) in Cartesian coordinates, where p_i is the i-th prime. - Ya-Ping Lu, Sep 21 2020
LINKS
FORMULA
a(n) = floor(product of the first n primes/n!).
a(n) = floor( A002110(n) / A000142(n) ).
EXAMPLE
a(5) = floor(2*3*5*7*11/5!) = floor(2310/120) = 19.
MAPLE
a:=proc(n) options operator, arrow: floor(mul(ithprime(i)/i, i=1..n)) end proc: seq(a(n), n=1..25); # Emeric Deutsch, Mar 14 2008
MATHEMATICA
Table[Floor[Product[Prime[i]/i, {i, n}]], {n, 0, 25}] (* G. C. Greubel, Oct 19 2016 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Ctibor O. Zizka, Feb 23 2008
EXTENSIONS
Corrected and extended by Emeric Deutsch, Mar 14 2008
STATUS
approved