login
A112755
Smallest prime factor of n-th number of the form 3^i*5^j.
3
1, 3, 5, 3, 3, 5, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3
OFFSET
1,2
LINKS
FORMULA
a(n) = A020639(A003593(n));
a(n) <= A112756(n) <= 5.
MATHEMATICA
s = {}; m = 12; Do[n = 5^k; While[n <= 5^m, AppendTo[s, n]; n *= 3], {k, 0, m}]; FactorInteger[#][[1, 1]] & /@ Union[s] (* Amiram Eldar, Feb 07 2020 *)
PROG
(Python)
from sympy import integer_log
from oeis_sequences.OEISsequences import bisection
def A112755(n):
if n == 1: return 1
def f(x): return n+x-sum(integer_log(x//5**i, 3)[0]+1 for i in range(integer_log(x, 5)[0]+1))
return 3+(bool(bisection(f, n, n)%3)<<1) # Chai Wah Wu, Mar 13 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 18 2005
STATUS
approved