|
|
A119790
|
|
a(n) is the sum of the positive integers each of which is <= n and is divisible by exactly one prime dividing n (but is coprime to every other prime dividing n). (a(1) = 1).
|
|
4
|
|
|
1, 2, 3, 6, 5, 9, 7, 20, 18, 25, 11, 36, 13, 49, 45, 72, 17, 81, 19, 100, 84, 121, 23, 144, 75, 169, 135, 196, 29, 210, 31, 272, 198, 289, 175, 324, 37, 361, 273, 400, 41, 420, 43, 484, 405, 529, 47, 576, 196, 625, 459, 676, 53, 729, 385, 784, 570, 841, 59, 840, 61, 961
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
12 is divisible by 2 and 3. The positive integers which are <= 12 and which are divisible by 2 or 3 but not by both 2 and 3 are: 2, 3, 4, 8, 9, 10. a(12) = the sum of these integers, which is 36.
|
|
MAPLE
|
f:= proc(n) local P;
P:= convert(numtheory:-factorset(n), list);
convert(select(k -> nops(select(p->k mod p = 0, P))=1, [$2..n]), `+`)
end proc:
|
|
MATHEMATICA
|
Table[Total@ Select[Range@ n, Function[k, Total@ Boole@ Map[Divisible[k, #] &, FactorInteger[n][[All, 1]]] == 1]], {n, 62}] (* Michael De Vlieger, Oct 01 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|