A376361 The number of distinct prime factors of the powerful numbers.

0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 3, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 3, 3, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2

Offset: 1

Author

Amiram Eldar, Sep 21 2024

Keywords

• nonn
• easy

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000
• Sourabhashis Das, Wentang Kuo, and Yu-Ru Liu, Distribution of omega(n) over h-free and h-full numbers, arXiv:2409.10430 [math.NT], 2024. See Theorem 1.2.
• Index entries for sequences related to powerful numbers.

Crossrefs

Cf. A001221, A001694, A072047, A077761, A090699, A376362, A376363, A376365.

Programs

Mathematica

f[k_] := Module[{e = If[k == 1, {}, FactorInteger[k][[;; , 2]]]}, If[AllTrue[e, # > 1 &], Length[e], Nothing]]; Array[f, 3500]

PARI

lista(kmax) = {my(e, is); for(k = 1, kmax, e = factor(k)[, 2]; is = 1; for(i = 1, #e, if(e[i] == 1, is = 0; break)); if(is, print1(#e, ", ")));}

Formula

a(n) = A001221(A001694(n)).

Sum_{A001694(k) <= x} a(k) = c * sqrt(x) * (log(log(x)) + B - log(2) + L(2, 3) - L(2, 4)) + O(sqrt(x)/log(x)), where c = zeta(3/2)/zeta(3) (A090699), B is Mertens's constant (A077761), L(h, r) = Sum_{p prime} 1/(p^(r/h - 1) * (p - p^(1 - 1/h) + 1)), L(2, 3) = 1.07848461669337535407..., and L(2, 4) = 0.57937575954505652569... (Das et al., 2024).