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