When trying around with the DivisorSigma
function of Mathematica, I found this Identity:
$\#\{a\mid\exists b\in\mathbb{Z}[i]: ab=n\}=\underbrace{\#\{a\mid\exists b\in\mathbb{N}: ab=n\}^2}_{\sigma(0,n)^2}\Leftrightarrow \forall p|n,\;p\text{ prime}: p\equiv 1\mod 4$
(In words: the number of gauss integer divisors of n is equal to the square of the number of integer divisors of n iff n is in A004613)
I could verify it for values up to 10 million. However, I have been unable to find any Identities that could allow me to prove them. I could take several results from exactly that OEIS page, however none of those helped me out. I am missing some result that connects the gaussian integer divisors with the real ones. I would be very happy with any help on this problem.