cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A102924 Real part of Gaussian amicable numbers in order of increasing magnitude. See A102925 for the imaginary part.

This page as a plain text file.
%I A102924 #9 Feb 16 2025 08:32:56
%S A102924 -1105,-1895,-2639,-3235,-3433,-3970,-4694,-3549,-766,-4478,-6880,
%T A102924 5356,-6468,8008,4232,-8547
%N A102924 Real part of Gaussian amicable numbers in order of increasing magnitude. See A102925 for the imaginary part.
%C A102924 For a Gaussian integer z, let the sum of the proper divisors be denoted by s(z) = sigma(z)-z, where sigma(z) is sum of the divisors of z, as defined by Spira for Gaussian integers. Then z is an amicable Gaussian number if z and s(z) are different and z = s(s(z)). The smallest Gaussian amicable number in the first quadrant is 8008+3960i.
%H A102924 R. Spira, <a href="http://www.jstor.org/stable/2312472">The Complex Sum Of Divisors</a>, American Mathematical Monthly, 1961 Vol. 68, pp. 120-124.
%H A102924 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AmicablePair.html">Amicable Pair</a>
%e A102924 For z=-1105+1020i, we have s(z)=-2639-1228i and s(s(z))=z.
%t A102924 s[z_Complex] := DivisorSigma[1, z]-z; nn=10000; lst={}; Do[d=a^2+b^2; If[d<nn^2, z=a+b*I; Do[If[s[s[z]]==z, AppendTo[lst, {d, z}]]; z=z*I, {4}]], {a, nn}, {b, nn}]; Re[Transpose[Sort[lst]][[2]]]
%Y A102924 Cf. A102506 (Gaussian multiperfect numbers), A102531 (absolute Gaussian perfect numbers).
%K A102924 sign,more
%O A102924 1,1
%A A102924 _T. D. Noe_, Jan 19 2005