|
%I #26 Jan 05 2020 05:54:44
%S 30,70,105,231,286,627,646,805,897,1122,1581,1798,2730,2958,2967,3055,
%T 3526,3570,4070,4543,5487,5658,6461,6745,7198,7881,8778,8970,9222,
%U 9282,9717,10366,10370,10626,10707,11130,14231,15015,16377,16530,19866
%N Composite numbers that are products of distinct primes and divisible by the sum of those primes.
%H Amiram Eldar, <a href="/A131647/b131647.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2000 from Harvey P. Dale)
%e 1122 = 2*3*11*17 and 1122 is divisible by 2+3+11+17 = 33.
%p with(numtheory): P:=proc(q) local a,k,n; for n from 2 to q do
%p if issqrfree(n) and not isprime(n) then a:=ifactors(n)[2];
%p if type(n/add(a[k][1],k=1..nops(a)),integer) then print(n); fi;
%p fi; od; end: P(10^9); # _Paolo P. Lava_, Sep 19 2014
%t Select[Range[2, 20000], PrimeQ[ # ] == False && Union[Transpose[FactorInteger[ # ]][[2]]] == {1} && Mod[ #, Plus @@ Transpose[FactorInteger[ # ]][[1]]] == 0 &]
%t pdpQ[n_]:=Module[{fi=Transpose[FactorInteger[n]]},!PrimeQ[n]&&Max[fi[[2]]] == 1&&Divisible[n,Total[fi[[1]]]]]; Select[Range[2,50000],pdpQ] (* _Harvey P. Dale_, Oct 16 2013 *)
%o (PARI) lista(nn) = {forcomposite(n=1, nn, f = factor(n); nbp = #f~; if ((vecmax(f[,2]) == 1) && !(n % sum(i=1, nbp, f[i, 1])), print1(n, ", ")););} \\ _Michel Marcus_, Sep 19 2014
%Y Sequence union A000040 = A005117 intersect A086486. - _Ray Chandler_, Nov 29 2011
%K nonn
%O 1,1
%A _Tanya Khovanova_, Sep 08 2007
|
