OFFSET
1,4
COMMENTS
a(n) depends only on the prime signature of n.
a(n) is the sum of the k-adic valuations of n for k >= 2. - Friedjof Tellkamp, Jan 25 2025
LINKS
FORMULA
a(p) = 1 for any prime number p.
a(p^k) = A006218(k) for any k >= 0 and any prime number p.
a(n) = 2^A001221(n) - 1 for any squarefree number n.
a(n) = 3 for any semiprime number n.
a(m*n) >= a(m) + a(n).
a(n) <= A033093(n). - Michel Marcus, Aug 22 2019
From Friedjof Tellkamp, Feb 27 2024: (Start)
G.f.: Sum_{k>=2, j>=1} x^(k^j)/(1-x^(k^j)).
Dirichlet g.f.: zeta(s) * Sum_{k>=1} (zeta(k*s) - 1).
Sum_{n>=1} a(n)/n^2 = Pi^2/8 (A111003). (End)
EXAMPLE
For n = 12: 12 has 2 trailing zeros in base 2 (1100), 1 trailing zero in bases 3, 4, 6 and 12 (110, 30, 20, 10) and no trailing zero in other bases, hence a(12) = 1*2 + 4*1 = 6.
MATHEMATICA
Table[DivisorSum[n, IntegerExponent[n, #] &, # > 1 &], {n, 84}] (* Jon Maiga, Aug 25 2019 *)
PROG
(PARI) a(n) = sumdiv(n, d, if (d>1, valuation(n, d), 0))
(PARI) a(n) = {if(n == 1, return(0)); my(f = factor(n)[, 2], res = 0, t = 2, of = f, nf = f >> 1, nd(v) = prod(i = 1, #v, v[i] + 1)); while(Set(of) != [0], res += (nd(of) - nd(nf)) * (t-1); of = nf; t++; nf = f \ t); res} \\ David A. Corneth, Aug 22 2019
CROSSREFS
KEYWORD
nonn,base,changed
AUTHOR
Rémy Sigrist, Aug 21 2019
STATUS
approved