OFFSET
0,1
COMMENTS
The asymptotic probability that the greatest common unitary divisor of two positive integers selected at random is a cubefree number (A004709).
In general, the asymptotic probability that the greatest common unitary divisor of two positive integers selected at random is a k-free number (a number that is not divisible by a k-th power other than 1) is Product_{p prime} (1 - (p-1)/(p^(2*k)*(p+1))) = zeta(2) * Product_{p prime} (1 - 1/p^2 - 1/p^(2*k) + 2/p^(2*k+1) - 1/p^(2*k+2)).
FORMULA
Equals zeta(2) * Product_{p prime} (1 - 1/p^2 - 1/p^6 + 2/p^7 - 1/p^8).
EXAMPLE
0.994059906006358858812968535964200127457153710694827...
PROG
(PARI) prodeulerrat(1 - (p-1)/(p^6*(p+1)))
CROSSREFS
The asymptotic probability that the greatest common unitary divisor of two positive integers selected at random is: A021016 (even), A306071 (1), A393891 (squarefree), this constant (cubefree), A393893 (powerful), A393894 (cubefull), A393895 (square), A393896 (cube), A393897 (exponentially odd number), A393898 (prime), A393899 (prime power), A393900 (perfect power).
KEYWORD
nonn,cons
AUTHOR
Amiram Eldar, Mar 02 2026
STATUS
approved
