OFFSET
1,3
COMMENTS
The asymptotic mean of the number of cubefull divisors of the greatest common divisor of two positive integers selected independently at random.
In general, the asymptotic mean of the number of k-full divisors (k-full numbers are numbers whose prime factorization has no exponent that is smaller than k) of the greatest common divisor of two positive integers selected independently at random is Product_{p prime} (1 + 1/(p^(2*k) - p^(2*k-2))).
FORMULA
EXAMPLE
1.022486596136980366191611409373598359445927292726914...
PROG
(PARI) prodeulerrat(1 + 1/(p^6 - p^4))
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Amiram Eldar, Mar 17 2026
STATUS
approved
