|
| |
|
|
A368405
|
|
Infinitary version of Mertens's function: a(n) = Sum_{k=1..n} A064179(k).
|
|
2
|
|
|
|
1, 0, -1, -2, -3, -2, -3, -2, -3, -2, -3, -2, -3, -2, -1, -2, -3, -2, -3, -2, -1, 0, -1, -2, -3, -2, -1, 0, -1, -2, -3, -2, -1, 0, 1, 2, 1, 2, 3, 2, 1, 0, -1, 0, 1, 2, 1, 2, 1, 2, 3, 4, 3, 2, 3, 2, 3, 4, 3, 2, 1, 2, 3, 4, 5, 4, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
f[p_, e_] := (-1)^DigitCount[e, 2, 1]; imu[1] = 1; imu[n_] := Times @@ f @@@ FactorInteger[n]; Accumulate[Array[imu, 100]]
|
|
|
PROG
|
(PARI) imu(n) = vecprod(apply(x -> (-1)^hammingweight(x), factor(n)[, 2]));
lista(nmax) = {my(s = 0); for(k = 1, nmax, s+ = imu(k); print1(s, ", ")); }
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
sign,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
