|
MATHEMATICA
|
Clear[nn, h, a, n, d, b, m];
nn = 500;
h = 1;
a[n_] := If[n < 1, 0, Sum[d MoebiusMu@d, {d, Divisors[n]}]];
TableForm[Transpose[Table[{n, a[n]}, {n, 1, nn}]]];
b = DeleteCases[
Table[Sum[
Sum[If[Mod[n, k] == 0, a[GCD[n/k, m]]*a[GCD[k, m + h]], 0], {k, 1,
n}], {m, 1, n}], {n, 1, nn}], 0]
|