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.
%I A306313 #11 Feb 20 2019 15:09:37 %S A306313 1584,5616,7452,8256,15698,16956,18525,25662,28512,34935,35152,35275, %T A306313 35581,35748,36584,46225,47265,47594,51842,52374,54479,55223,55348, %U A306313 58432,65712,73125,93875,118465,151632,153615,154462,159712,161785,172577,176225,178754,182596 %N A306313 Numbers such that the product of their digits is equal to 10 times the sum of their prime factors, without multiplicity. %C A306313 Similar to Rhonda numbers (A099542) where the multiplicity of the prime factors is taken into account. %e A306313 1584 = 2^4*3^2*11 and 1*5*8*4 = 160 = 10*(2+3+11). %p A306313 with(numtheory): select(n->convert(convert(n,base,10),`*`)=10*add(k,k=factorset(n)),[$1..120000]); %t A306313 Select[Range[2*10^5], Times @@ IntegerDigits[#] == 10 Total[FactorInteger[#][[All, 1]] ] &] (* _Michael De Vlieger_, Feb 15 2019 *) %Y A306313 Cf. A099542. %K A306313 nonn,base,easy %O A306313 1,1 %A A306313 _Paolo P. Lava_, Feb 06 2019