%I #10 Mar 01 2016 17:36:47

%S 2,3,4,5,7,27,46,52,93,117,121,143,170,174,187,228,235,240,242,250,

%T 259,341,408,451,504,512,671,682,684,720,754,759,781,810,867,888,1017,

%U 1120,1143,1155,1173,1247,1272,1276,1357,1362,1377,1449,1456,1524,1537,1564

%N Numbers n such that sum of digits of n is equal to the product of the digits of the sum of the prime factors of n, counted with multiplicity.

%H Harvey P. Dale, <a href="/A063738/b063738.txt">Table of n, a(n) for n = 1..1000</a>

%e 27: 2+7=9, 27= 3 * 3 * 3, 3+3+3=9; 170: 170=2*5*17, 1+7+0=8, 2+5+17=24, 2*4=8.

%t sdQ[n_]:=Total[IntegerDigits[n]]==Times@@IntegerDigits[Total[ Flatten[ Table[ #[[1]],{#[[2]]}]&/@FactorInteger[n]]]]; Select[Range[2,2000],sdQ] (* _Harvey P. Dale_, Mar 01 2016 *)

%K easy,base,nonn

%O 1,1

%A _Felice Russo_, Aug 13 2001

%E Better description and more terms from _Matthew Conroy_, Aug 14 2001