|
%I #18 Sep 30 2023 21:55:49
%S 0,1,1,0,1,2,1,0,0,2,1,1,1,2,2,1,1,1,1,1,2,2,1,1,0,2,0,1,1,3,1,0,2,2,
%T 2,0,1,2,2,1,1,3,1,1,1,2,1,2,0,1,2,1,1,1,2,1,2,2,1,2,1,2,1,1,2,3,1,1,
%U 2,3,1,0,1,2,1,1,2,3,1,2,1,2,1,2,2,2,2,1,1,2,2,1,2,2,2,1,1,1,1,0,1,3,1,1,3
%N a(n) = number of nonzero exponents in the prime factorization of n which are not primes.
%H Antti Karttunen, <a href="/A125070/b125070.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F From _Amiram Eldar_, Sep 30 2023: (Start)
%F Additive with a(p^e) = A005171(e).
%F Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B - C), where B is Mertens's constant (A077761) and C = Sum_{p prime} (P(p) - P(p+1)) = 0.39847584805803104040..., where P(s) is the prime zeta function. (End)
%e 720 has the prime-factorization of 2^4 *3^2 *5^1. Two of these exponents, 4 and 1, are not primes. So a(720) = 2.
%t f[n_] := Length @ Select[Last /@ FactorInteger[n], ! PrimeQ[ # ] &];Table[f[n], {n, 110}] (* _Ray Chandler_, Nov 19 2006 *)
%o (PARI) A125070(n) = vecsum(apply(e -> if(isprime(e),0,1), factorint(n)[, 2])); \\ _Antti Karttunen_, Jul 07 2017
%Y Cf. A001221, A005171, A077761, A125071.
%K nonn,easy
%O 1,6
%A _Leroy Quet_, Nov 18 2006
%E Extended by _Ray Chandler_, Nov 19 2006
|
