login

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”).

A093872
Least composite number with sum of the prime divisors = n, or zero if no such number exists.
1
0, 4, 9, 0, 6, 0, 10, 15, 14, 21, 121, 35, 22, 33, 26, 39, 210, 65, 34, 51, 38, 57, 273, 95, 46, 69, 285, 115, 399, 161, 58, 87, 62, 93, 741, 155, 435, 217, 74, 111, 651, 185, 82, 123, 86, 129, 777, 215, 94, 141, 645, 235, 903, 329, 106, 159, 987, 265, 1645, 371, 118
OFFSET
1,2
LINKS
MATHEMATICA
sopf[n_] := Plus @@ First @ Transpose @ FactorInteger[n]; m = 100; seq = Table[0, {m}]; c = 0; n = 4; While[c < m - 3, If[CompositeQ[n], s = sopf[n]; If[s <= m && seq[[s]] == 0, c++; seq[[s]] = n]]; n++]; seq (* Amiram Eldar, Feb 23 2020 *)
CROSSREFS
Cf. A008472.
Sequence in context: A021208 A298813 A021675 * A097906 A373204 A070016
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Apr 20 2004
EXTENSIONS
Corrected and extended by Robert Gerbicz, Aug 21 2006
STATUS
approved