Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102924
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102924 Real part of Gaussian amicable numbers in order of increasing magnitude. See A102925 for the imaginary part. +0
2
-1105, -1895, -2639, -3235, -3433, -3970, -4694, -3549, -766, -4478, -6880, 5356, -6468, 8008, 4232, -8547 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

REFERENCES

Robert Spira, The complex sum of divisors, Amer. Math. Monthly, Vol. 68, No. 2 (Feb. 1961), 120-124.

LINKS

Eric Weisstein's World of Mathematics, Amicable Pair

EXAMPLE

For z=-1105+1020i, we have s(z)=-2639-1228i and s(s(z))=z.

MATHEMATICA

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]]]

CROSSREFS

Cf. A102506 (Gaussian multiperfect numbers), A102531 (absolute Gaussian perfect numbers).

Sequence in context: A052155 A097102 A159781 this_sequence A083738 A157376 A066163

Adjacent sequences: A102921 A102922 A102923 this_sequence A102925 A102926 A102927

KEYWORD

sign

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jan 19 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research