|
| |
|
|
A099542
|
|
Rhonda numbers to base 10. An integer n is a Rhonda number to base b if the product of its digits in base b equals b*Sum of prime factors of n (including multiplicity).
|
|
12
| |
|
|
1568, 2835, 4752, 5265, 5439, 5664, 5824, 5832, 8526, 12985, 15625, 15698, 19435, 25284, 25662, 33475, 34935, 35581, 45951, 47265, 47594, 52374, 53176, 53742, 54479, 55272, 56356, 56718, 95232, 118465, 133857, 148653, 154462, 161785
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Does every Rhonda number to base 10 contain at least one 5? [From Howard Berman (howard_berman(AT)hotmail.com), Oct 22 2008]
|
|
|
LINKS
| Author?, Smith numbers and Rhonda Numbers.
Author?, Infinitely Many Rhondas
Walter Schneider, Rhonda Numbers
Eric Weisstein's World of Mathematics, Rhonda Number
Harvey P. Dale, Table of n, a(n) for n = 1..180
|
|
|
EXAMPLE
| 1568 has prime factorization 2^{5} 7^{2}. Sum of prime factors=2*5+7*2=24. Product of digits of 1568=1*5*6*8=240 = 10*24, hence 1568 is a Rhonda number to base 10.
|
|
|
MATHEMATICA
| Select[Range[200000], 10Total[Times@@@FactorInteger[#]]==Times@@ IntegerDigits[ #]&] (* From Harvey P. Dale, Oct 16 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A072394 A035890 A045276 * A035765 A107561 A202465
Adjacent sequences: A099539 A099540 A099541 * A099543 A099544 A099545
|
|
|
KEYWORD
| base,nice,nonn
|
|
|
AUTHOR
| Mark Hudson (mrmarkhudson(AT)hotmail.com), Oct 21 2004
|
| |
|
|
