OFFSET
1,1
COMMENTS
See sequence A099542 for the definition of Rhonda numbers and some links. 560 is the smallest integer that is a Rhonda number to some base.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Kevin S. Brown's Mathpages, Infinitely Many Rhondas.
Eric Weisstein's World of Mathematics, Rhonda Number.
Wikipedia, Duodecimal.
EXAMPLE
The product of the base 12 digits of 560 is 3*10*8=240; the sum of the prime factors of 560 is 4*2+5+7=20; and 240=12*20 so 560 is a Rhonda number to base 12.
MATHEMATICA
With[{b = 12}, Select[Range[b^5], Times @@ IntegerDigits[#, b] == b*Total[Times @@@ FactorInteger[#]] &] ] (* Michael De Vlieger, Jan 23 2026 *)
PROG
(Haskell)
a100971 n = a100971_list !! (n-1)
a100971_list = filter (rhonda 12) $ iterate z 1 where
z x = 1 + if r < 11 then x else 12 * z x' where (x', r) = divMod x 12
-- Function rhonda as in A099542.
-- Reinhard Zumkeller, Mar 07 2015
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Mark Hudson (mrmarkhudson(AT)hotmail.com), Nov 25 2004
STATUS
approved
