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

A213386
Smallest number k such that the sum of the distinct prime divisors of k equals n times a square > 1.
5
14, 15, 35, 39, 51, 95, 115, 87, 155, 111, 123, 215, 235, 159, 371, 183, 302, 335, 219, 511, 395, 415, 267, 623, 291, 303, 482, 327, 339, 791, 554, 1415, 635, 655, 411, 695, 662, 447, 698, 471, 734, 815, 835, 519, 1211, 543, 842, 1991, 579, 591, 914, 2167
OFFSET
1,1
COMMENTS
Smallest k such that sopf(k) = n*q where q is a square.
LINKS
EXAMPLE
a(55) = 2631 because 2631 = 3*877 and 3 + 877 = 880 = 55*16 where 16 is a square.
MAPLE
with (numtheory):
sopf:= proc(n) option remember;
add(i, i=factorset(n))
end:
a:= proc(n) local k, p;
for k from 2 while irem(sopf(k), n, 'p')>0 or
sqrt(p)<>floor(sqrt(p)) or p=1 do od; k
end:
seq (a(n), n=1..100);
CROSSREFS
Sequence in context: A162283 A180328 A211144 * A370403 A370405 A357625
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jun 10 2012
STATUS
approved