proposed
approved
proposed
approved
editing
proposed
Smallest number b such that in base -b representation the prime factors of n have equal lengths.
approved
editing
proposed
approved
editing
proposed
a(n) = a(A066048(n)). [The result depends only on the smallest and the largest prime factor of n].]
proposed
editing
editing
proposed
(Haskell)
import Data.List (unfoldr); import Data.Tuple (swap)
a251725 1 = 1
a251725 n = if length ps == 1 then 1 else head $ filter f [2..] where
f b = all (== len) lbs where len:lbs = map (length . d b) ps
ps = a027748_row n
d b = unfoldr (\z -> if z == 0 then Nothing else Just $ swap $ divMod z b)
-- Reinhard Zumkeller, Dec 17 2014
Cf. A027748.