OFFSET
1,3
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
FORMULA
From Ridouane Oudra, Oct 26 2025: (Start)
a(n) = Card_{ k | A003593(k) <= n }.
a(n) = Sum_{k=1..n} mu(15*k)*floor(n/k).
a(n) = Sum_{k=1..n} (floor(15^k/k)-floor((15^k-1)/k)).
a(n) = Sum_{i=0..floor(log_3(n))} (floor(log_5(n/3^i)) + 1).
Asymptotically: a(n) ~ c*log(3*n)*log(5*n), where c=1/(2*log(3)*log(5)). (End)
MAPLE
with(numtheory): seq(add(mobius(15*k)*floor(n/k), k=1..n), n=1..100); # Ridouane Oudra, Oct 26 2025
MATHEMATICA
Accumulate[Table[Boole[n == Times @@ ({3, 5}^IntegerExponent[n, {3, 5}])], {n, 1, 100}]] (* Amiram Eldar, May 04 2025 *)
PROG
(Magma) [&+[MoebiusMu(15*k)*Floor(n/k):k in [1..n]]: n in [1..97]]; // Marius A. Burtea, Jul 30 2019
(Python)
from sympy import integer_log
def A112751(n): return sum(integer_log(n//5**i, 3)[0]+1 for i in range(integer_log(n, 5)[0]+1)) # Chai Wah Wu, Jan 28 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 18 2005
STATUS
approved
