OFFSET
1,1
COMMENTS
Numbers k such that N(sigma(k)) > 2*N(k) = 2*k^2, where sigma(k) = A103228(k) + i*A103229(k) is the sum of divisors of k in Gaussian integers (i is the imaginary unit), and N(z) = Re(z)^2 + Im(z)^2 is the norm of the complex number z.
The number of terms not exceeding 10^k for k = 1, 2, ... is 6, 70, 711, 7002, 69925, 701081, 7016287, 70074003, 700557394, 7007078826, ... Apparently this sequence has an asymptotic density of ~0.7.
REFERENCES
Miriam Hausman, On Norm Abundant Gaussian Integers, The Journal of the Indian Mathematical Society, Vol. 49 (1987), pp. 119-123.
József Sándor, Dragoslav S. Mitrinovic and Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, chapter III, page 120.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Robert Spira, The Complex Sum of Divisors, The American Mathematical Monthly, Vol. 68, No. 2 (1961), pp. 120-124.
EXAMPLE
2 is norm-abundant since sigma(2) = 2 + 3*i and N(2 + 3*i) = 2^2 + 3^2 = 13 > 2 * 2^2 = 8.
MATHEMATICA
normAbQ[z_] := Abs[DivisorSigma[1, z, GaussianIntegers -> True]]^2 > 2*Abs[z]^2; Select[Range[100], normAbQ]
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Feb 16 2020
STATUS
approved