Recursive formulas related to the summation of the mobius function

For positive integers n, let μ(n) be the Mobius function, and M(n) its sum M(n) = Pn k=1 μ(k). We nd some identities and recursive formulas for computing M(n); in particular, we present a two-parametric family of recursive formulas.