OFFSET
1,1
COMMENTS
Let Omega_n(k) be the number of prime divisors of k not exceeding prime(n) counted with multiplicity, and omega_n(k) the number of distinct prime divisors of k not exceeding prime(n). Then, f(n) = a(n)/A340819(n) is the asymptotic density of numbers k such that Omega_n(k) == omega_n(k) (mod 2).
Equivalently, f(n) is the asymptotic density of numbers k such that A046660(d_n(k)) is even, where d_n(k) is the largest prime(n)-smooth divisor of k.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..462
Jérémie Detrey, Pierre-Jean Spaenlehauer and Paul Zimmermann, Computing the rho constant, 2016.
Michael J. Mossinghoff and Timothy S. Trudgian, A tale of two omegas, arXiv:1906.02847 [math.NT], 2019.
FORMULA
Let delta(n) = 1/(prime(n)*(prime(n)+1)) be the asymptotic density of numbers whose prime(n)-adic valuation is positive and even. Let f(0) = 1. Then, f(n) = f(n-1)*(1 - delta(n)) + (1 - f(n))*delta(n).
Limit_{n->oo} f(n) = 0.73584... (A340820).
EXAMPLE
The sequence of fractions begins with 5/6, 7/9, 41/54, 3/4, 197/264, 229/308, 5827/7854, 277/374, 1157/1564, 8382/11339, ...
MATHEMATICA
d[p_] := 1/(p*(p + 1)); delta[n_] := delta[n] = d[Prime[n]]; f[0] = 1; f[n_] := f[n] = f[n - 1] * (1 - delta[n]) + (1 - f[n - 1]) * delta[n]; Numerator @ Array[f, 30]
CROSSREFS
KEYWORD
nonn,frac
AUTHOR
Amiram Eldar, Jan 22 2021
STATUS
approved