login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075658 Numbers k such that the sum of prime divisors of k (A008472) is composite. 2
14, 15, 21, 26, 28, 30, 33, 35, 38, 39, 42, 45, 46, 51, 52, 55, 56, 57, 60, 62, 63, 65, 66, 69, 70, 74, 75, 76, 77, 78, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 98, 99, 102, 104, 105, 106, 110, 111, 112, 114, 115, 117, 119, 120, 122, 123, 124, 126, 129, 130, 132, 133 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
A075658 := proc(n) local i, j, t1, t; t := NULL; for i from 2 to n do t1 := 0; for j from 1 to i do if i mod ithprime(j) = 0 then t1 := t1+ithprime(j); fi; od; if not(isprime(t1)) then t := t, i; fi; od; t; end;
MATHEMATICA
Select[Range[133], CompositeQ[Plus @@ FactorInteger[#][[;; , 1]]] &] (* Amiram Eldar, Nov 14 2019 *)
PROG
(Magma) f:=func<n|&+PrimeDivisors(n)>; [k:k in [2..150]| not IsPrime(f(k))]; // Marius A. Burtea, Nov 14 2019
CROSSREFS
Cf. A008472.
Sequence in context: A136012 A038456 A346549 * A047821 A195238 A085816
KEYWORD
nonn
AUTHOR
Floor van Lamoen, Sep 23 2002 and Oct 02 2002
EXTENSIONS
Offset corrected by Amiram Eldar, Nov 14 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 16:01 EST 2023. Contains 367612 sequences. (Running on oeis4.)