OFFSET
0,1
COMMENTS
Sathe proved that pi_k(x), the count of numbers <= x with exactly k prime factors, satisfies pi_k(x) ~ f(k/log log x) * x/log x * (log log x)^(k-1)/(k-1)! where f(x) = c/gamma(x+1) * Product_{p prime} 1 + x*exp(-x/p)/p and c is this constant. This holds uniformly for k < (2 - eps)log log x for any fixed eps > 0. - Charles R Greathouse IV, Aug 02 2016
REFERENCES
L. G. Sathe, On a problem of Hardy on the distribution of integers having a given number of prime factors. I., J. Indian Math. Soc. (N.S.) 17 (1953), pp. 63-82.
L. G. Sathe, On a problem of Hardy on the distribution of integers having a given number of prime factors. II., J. Indian Math. Soc. (N.S.) 17 (1953), pp. 83-141.
Atle Selberg, Note on a paper by L. G. Sathe, J. Indian Math. Soc. (N.S.) 18 (1954), pp. 83-87.
EXAMPLE
0.72926474425711901885361531693130012817754597103784361867476691287655...
MATHEMATICA
digits = 103; S = E^-NSum[PrimeZetaP[ n]/n, {n, 2, Infinity}, WorkingPrecision -> digits + 10, NSumTerms -> 3*digits]; RealDigits[S, 10, digits] // First (* Jean-François Alcover, Sep 11 2015 *)
PROG
(PARI) /* Helper functions and a function f to compute a k-th order approximation of the constant using the primes up to lim. */
eps(x=1.)=my(p=if(x, precision(x), default(realprecision))); precision(2. >> (32 * ceil(p * 38539962 / 371253907)), 9);
primezeta(s)=my(lm=s*log(2)); lm=lambertw(lm/eps())\lm; sum(k=1, lm, moebius(k)/k*log(abs(zeta(k*s))));
f(lim, k)=my(t=0.); forprime(p=2, lim, t+=log(1-1/p)+sum(i=1, k, 1/i/p^i)); exp(t-sum(i=2, k, primezeta(i)/i));
f(1e8, 9)
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Charles R Greathouse IV, Aug 04 2014
EXTENSIONS
More digits from Jean-François Alcover, Sep 11 2015
STATUS
approved