Let $m\geq 1$ an integer and $\sigma(m)=\sum_{d\mid m}d$ the sum of divisors function, then Möbius inversion formula states $$m=\sum_{d\mid m}\sigma(d)\mu\left(\frac{m}{d}\right),$$ since this convolution is commutative.
If we assume that $n=\prod_{p\mid n}p^{e_p}$ is a perfect number, that is an integer such that $\sigma(n)=2n$, (an example is $6=2^1\cdot 3^1$) then we can write that $$\sigma(n)=2\sum_{d\mid n}\sigma(d)\mu\left(\frac{n}{d}\right)$$ holds, and because the sum of divisor function is a multiplicative arithmetic function then $$\prod_{p\mid n}\sigma\left(p^{e_p}\right)=\sigma(n)=2\sum_{d\mid n}\sigma(d)\mu\left(\frac{n}{d}\right)$$
(where I've written LHS in such expanded way with the purpose to show it, if you know from this identity how get more interesting facts than the following mine). In particular dividing by $\sigma(n)=2n$ it is obvious then that $$\left(2\sum_{\substack{d\mid n\\d Question. Please can do you argue if the following calculations are rights and if the fact that I've claimed for odd perfect numbers is obvious? Thus I am asking if do you know if there were some mistakes in previous simple calculations, and secondly if is known the sequence of odd integers $t>1$ satisfying $$\sum_{\substack{d\mid t\\d