Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Dec 05 2024 14:46:03
%S 1,2,3,5,6,7,24,375,392,640,2401,4802,4913,6400,7744,17576,42592,
%T 64000,106496,234256,295936,468750,546875,628864,640000,877952,
%U 1124864,1966080,2839714,3687936,4687500,4816896,4952198,6400000,6453888
%N Numbers whose product of distinct prime factors is equal to its sum of digits.
%C The product of the distinct prime factors of n (the squarefree kernel of n) is also denoted by rad(n) = A007947(n). - _Giovanni Resta_, Apr 21 2017
%H Giovanni Resta, <a href="/A067077/b067077.txt">Table of n, a(n) for n = 1..10000</a> (first 71 terms from Harry J. Smith)
%e The prime factors of 375 are 3,5, which have product = 15, the sum of the digits of 375, so 375 is a term of the sequence.
%t f[n_] := Times@@ (First/@ FactorInteger[n]); g[n_] := Plus @@ IntegerDigits[n]; Select[Range[10^5], f[#] == g[#] &] (* or *)
%t nd=12; up=10^nd; L={1}; Do[If[SquareFreeQ[su], ps = First /@ FactorInteger[su]; nps = Length@ ps; Clear[ric]; ric[n_, i_] := Block[{e = 0, m}, If[i > nps, If[Plus @@ IntegerDigits[su n] == su, Sow[su n]], While[ (m = n ps[[i]]^e ) su < up, ric[m, i+1]; e++]]]; z = Reap[ ric[1, 1]][[2]]; If[z != {}, L = Union[L, z[[1]]]]], {su, 2, 9 nd}]; L (* fast, terms < 10^12, _Giovanni Resta_, Apr 21 2017 *)
%t Select[Range[65*10^5],Times@@FactorInteger[#][[All,1]]==Total[ IntegerDigits[ #]]&] (* _Harvey P. Dale_, Dec 16 2018 *)
%o (PARI) isok(k)={vecprod(factor(k)[,1]) == sumdigits(k)} \\ _Harry J. Smith_, May 06 2010
%Y Cf. A007947, A006753, A057531, A057532, A050689, A070274, A070275, A063737, A285494.
%K base,nonn
%O 1,2
%A _Joseph L. Pe_, Feb 18 2002
%E a(19)-a(35) from _Donovan Johnson_, Sep 29 2009
%E a(1)=1 prepended by _Giovanni Resta_, Apr 21 2017