login
A382966
The number of non-unitary prime divisors of the n-th biquadratefree number that is not cubefree.
3
1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1
OFFSET
1,7
LINKS
FORMULA
a(n) = A056170(A375072(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = ((1/zeta(4)) * Sum_{p prime} (1/(p^2+1)) - (1/zeta(3)) * Sum_{p prime} ((p-1)/(p^3-1))) / (1/zeta(4) - 1/zeta(3)) = 1.20757893653588072073... .
MATHEMATICA
f[k_] := If[k == 1, Nothing, Module[{e = FactorInteger[k][[;; , 2]]}, If[Max[e] == 3, Count[e, _?(# > 1 &)], Nothing]]]; Array[f, 1000]
PROG
(PARI) list(lim) = {my(e); for(k = 2, lim, e = factor(k)[, 2]; if(vecmax(e) == 3, print1(#select(x -> x > 1, e), ", "))); }
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Apr 10 2025
STATUS
approved