cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A099543 Sums of the prime factors of the Rhonda numbers to base 10 (sequence A099542). The terms in this sequence are equal to (Product of digits of terms of A099542)/10, which is simply the definition of Rhonda numbers to base 10.

This page as a plain text file.
%I A099543 #21 Aug 29 2025 07:28:10
%S A099543 24,24,28,30,54,72,32,24,48,72,30,216,54,64,72,126,162,60,90,168,504,
%T A099543 84,63,84,504,70,270,168,54,96,252,288,96,168,343,784,96,216,405,96,
%U A099543 324,108,48,1260,160,144,192,1134,243,252,1080,72,192,144,486,81,48
%N A099543 Sums of the prime factors of the Rhonda numbers to base 10 (sequence A099542). The terms in this sequence are equal to (Product of digits of terms of A099542)/10, which is simply the definition of Rhonda numbers to base 10.
%H A099543 Reinhard Zumkeller, <a href="/A099543/b099543.txt">Table of n, a(n) for n = 1..1000</a>
%H A099543 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RhondaNumber.html">Rhonda Number</a>
%F A099543 a(n) = A001414(A099542(n)). - _Reinhard Zumkeller_, Dec 01 2012
%e A099543 The first term in A099542 is 1568. The sum of its prime factors is 24.
%t A099543 rnQ[n_]:=Times@@IntegerDigits[n]==10Total[Times@@@FactorInteger[n]]; Times@@IntegerDigits[#]/10&/@ Select[Range[350000], rnQ]  (* _Harvey P. Dale_, Mar 13 2011 *)
%o A099543 (Haskell)
%o A099543 a099543 = a001414 . a099542  -- _Reinhard Zumkeller_, Dec 01 2012
%Y A099543 Cf. A001414, A099542.
%K A099543 nonn,base,changed
%O A099543 1,1
%A A099543 Mark Hudson (mrmarkhudson(AT)hotmail.com), Oct 21 2004
%E A099543 More terms from _Harvey P. Dale_, Mar 13 2011