|
|
A340297
|
|
a(n) = (Sum of totatives of n) mod (Sum of primes dividing n with multiplicity).
|
|
2
|
|
|
1, 0, 0, 0, 1, 0, 4, 3, 6, 0, 3, 0, 6, 4, 0, 0, 6, 0, 8, 6, 6, 0, 6, 0, 6, 0, 3, 0, 0, 0, 6, 8, 6, 0, 6, 0, 6, 4, 1, 0, 0, 0, 5, 1, 6, 0, 10, 7, 8, 16, 12, 0, 2, 12, 9, 14, 6, 0, 0, 0, 6, 3, 4, 12, 4, 0, 17, 10, 0, 0, 0, 0, 6, 5, 11, 6, 0, 0, 6, 3, 6, 0, 0, 14, 6, 4, 9, 0, 1, 16, 26, 2, 6, 12, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,7
|
|
COMMENTS
|
a(n) = 0 if n is an odd prime.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 8, A023896(8) = 1+3+5+7 = 16 and A001414(n) = 2+2+2 = 6, so a(8) = 16 mod 6 = 4.
|
|
MAPLE
|
f:= proc(n) local F, t;
F:= ifactors(n)[2];
n*mul((t[1]-1)*t[1]^(t[2]-1), t=F)/2 mod add(t[1]*t[2], t=F);
end proc:
map(f, [$2..100]);
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|