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.

Showing 1-7 of 7 results.

A102506 Numbers n such that for some positive number k, z=n+ik is a complex multiperfect number; that is, z divides sigma(z), where sigma is the sum of divisors function extended to the complex numbers.

Original entry on oeis.org

1, 5, 6, 10, 12, 28, 60, 72, 100, 108, 120, 140, 150, 204, 263, 300, 526, 600, 672, 720, 912, 1200, 1470, 1520, 1704, 3600, 4560, 4680, 4828, 5584, 5880, 6240, 6312
Offset: 1

Views

Author

T. D. Noe, Jan 12 2005

Keywords

Comments

This sequence uses a number-theoretic extension of the sigma function that is due to Spira. A nonzero Gaussian integer has a unique factorization as u q1^e1 q2^e2..qn^en, where u is a unit (1,-1,i,-i), the qk are Gaussian primes in the first quadrant and the ek are positive integers.
Then Spira defines the sum of divisors to be Product_{k=1..n} (qk^(ek+1)-1)/(qk-1). This appears to be the natural number-theoretic extension. Spira's definition preserves the multiplicative property: if GCD(x,y)=1, then sigma(x*y)=sigma(x)*sigma(y). (Mathematica's DivisorSigma function uses this formula.)
It appears that the value of k, A102507, is unique for each n. The sum of divisors function, as defined by Spira, is implemented in Mathematica for complex z as the DivisorSigma[1,z]. For the z=n+ik given here, sigma(z)/z is usually a small Gaussian integer. The first instance of a positive integral value of sigma(z)/z is z=600+3800i, in which case the ratio is 3. The complex multiperfect numbers can be arranged into classes according to the value of sigma(z)/z. Does each class have a finite number of members?

Examples

			For n=1, we have z=1+3i. The divisors of z are 1, 1+i, 1+3i and 2+i. Hence sigma(z)=5+5i and sigma(z)/z = 2-i.
		

Crossrefs

Cf. A102507. Note that A101367 and A101366 use Mathematica's Divisors function, the sum of the first-quadrant divisors, which does not enjoy the nice multiplicative properties of Spira's sigma function.

Programs

  • Mathematica
    lst={}; Do[z=n+k*I; s=DivisorSigma[1, z]; If[Mod[s, z]==0, AppendTo[lst, z]; Print[{z, s, s/z}]], {n, 1200}, {k, 10000}]; Re[lst]

A102531 Real part of absolute Gaussian perfect numbers, in order of increasing magnitude.

Original entry on oeis.org

3, 15, 6, 19, 111, 91, 159, 72, 472, 904, 2584, 1616, 999, 4328, 702, 4424, 7048, 7328, 2474, 9352, 7144, 7240, 5117, 739, 6327, 15128, 13168, 1263, 14280, 3224, 21704, 15160, 21992, 14044, 23132, 9135, 23656, 24614, 7272, 15464, 9040, 28424, 30956, 14728, 32399
Offset: 1

Views

Author

T. D. Noe, Jan 13 2005

Keywords

Comments

An absolute Gaussian perfect number z satisfies abs(sigma(z)-z) = abs(z), where sigma(z) is sum of the divisors of z, as defined by Spira for Gaussian integers.

Examples

			For z=3+7i, we have sigma(z)-z = 7+3i, which has the same magnitude as z.
		

Crossrefs

See A102532 for the imaginary part.
Cf. A102506 and A102507 (Gaussian multiperfect numbers). See also A101366, A101367.

Programs

  • Mathematica
    lst={}; nn=1000; Do[z=a+b*I; If[Abs[z]<=nn && Abs[(DivisorSigma[1, z]-z)] == Abs[z], AppendTo[lst, {Abs[z]^2, z}]], {a, nn}, {b, nn}]; Re[Transpose[Sort[lst]][[2]]]

Extensions

a(22)-a(45) from Amiram Eldar, Feb 10 2020

A102532 Imaginary part of absolute Gaussian perfect numbers, in order of increasing magnitude.

Original entry on oeis.org

7, 42, 57, 82, 78, 189, 341, 549, 664, 1048, 1016, 3776, 4072, 1672, 5049, 3816, 1128, 368, 7097, 2504, 6816, 7912, 10743, 12605, 12606, 248, 10392, 16853, 15208, 20824, 344, 15688, 392, 18076, 1340, 22302, 5912, 1573, 24392, 21328, 24896, 7048, 1220, 29288, 9678
Offset: 1

Views

Author

T. D. Noe, Jan 13 2005

Keywords

Comments

See A102531 for the real part.

Crossrefs

Programs

  • Mathematica
    lst={}; nn=1000; Do[z=a+b*I; If[Abs[z]<=nn && Abs[(DivisorSigma[1, z]-z)] == Abs[z], AppendTo[lst, {Abs[z]^2, z}]], {a, nn}, {b, nn}]; Im[Transpose[Sort[lst]][[2]]]

Extensions

a(22)-a(45) from Amiram Eldar, Feb 10 2020

A101367 Perfect Abs. Real part of complex z such that Abs[(Total[Divisors[z]]-z)]=Abs[z].

Original entry on oeis.org

5, 3, 19, 15, 29, 6, 74, 19, 111, 147, 185, 91, 197, 269, 122, 159, 72, 827, 1487, 2903, 968, 999, 702, 5803, 326, 2474, 7871
Offset: 0

Views

Author

Ed Pegg Jr, Jan 13 2005

Keywords

Comments

Having Perfect Abs is not as good as being Perfect. A complex number can also have Abundant Abs or Deficient Abs.

Examples

			The divisors for 269+92i are: 1, 2+I, 3+4i, 6+5i, 7+2i, 7+16i, 12+11i, 13+34i, 17+126i, 32+47i, 39+2i, 269+92i. The (sum - k) is 139+248i. Abs[139+248i] == Abs[269+92i]
		

Crossrefs

Programs

  • Mathematica
    Re[Sort[Select[Flatten[Table[a + b I, {a, 1, 500}, {b, 1, 500}]], Abs[Total[Divisors[ # ]] - # ] == Abs[ # ] &], Abs[ #1] < Abs[ #2] &]]

Extensions

Ten more terms from Hans Havermann, Jan 15 2005

A332318 Real part of Gaussian norm-multiply-perfect numbers, in order of increasing norm.

Original entry on oeis.org

1, 2, 1, 3, 6, 5, 6, 10, 2, 8, 16, 12, 21, 18, 26, 30, 13, 43, 28, 6, 52, 60, 20, 10, 72, 56, 26, 28, 85, 95, 20, 100, 58, 80, 40, 36, 108, 120, 48, 190, 144, 176, 204, 38, 106, 214, 4, 84, 232, 276, 136, 216, 300, 174, 181, 263, 216, 312, 340, 140, 464, 20, 380
Offset: 1

Views

Author

Amiram Eldar, Feb 09 2020

Keywords

Comments

Norm-multiply-perfect numbers where defined by Spira as Gaussian integers z such that norm(sigma(z)) is divisible by norm(z), where sigma(z) is the sum of the divisors of z = a + b*i and norm(z) = z * conj(z) = a^2 + b^2.
If the ratio norm(sigma(z))/norm(z) is 2 then the number is called a norm-perfect. The norm-perfect numbers correspond to n = 1, 13, 26, ... They are 2 + i, 21 + 22*i, 56 + 64*i, ...
Only nonnegative terms are included, since if z = a + b*i is a norm-multiply-perfect number then z*i, -z and -z*i are also norm-multiply-perfect numbers and one of the four has nonnegative a and b. Terms with the same norm are ordered by their real parts.
The corresponding imaginary parts are in A332319.
The corresponding norms are 1, 5, 10, 10, 40, 50, 52, 200, 260, 260, 260, 468, ...
The corresponding ratios norm(sigma(k))/k are 1, 2, 5, 4, 5, 8, 5, 10, 9, 10, ...

Examples

			2 + i is a norm-perfect number since sigma(2 + i) = 3 + i, and (3^2 + 1^2) = 10 = 2 * 5 = 2 * (2^1 + 1^2).
1 + 3*i is a norm-multiply-perfect number since sigma(1 + 3*i) = 5 + 5*i, and (5^2 + 5^2) = 50 = 5 * 10 = 5 * (1^2 + 3^2).
		

Crossrefs

Programs

  • Mathematica
    csigma[z_] := DivisorSigma[1, z, GaussianIntegers -> True]; normultPerf[z_] := Divisible[Abs[csigma[z]]^2, Abs[z]^2]; seq = {}; max = 10^2; Do[z = a + b*I; If[Abs[z] <= max && normultPerf[z], AppendTo[seq, {Abs[z]^2, z}]], {a, 1, max}, {b, 0, max}]; Re[Transpose[Sort[seq]][[2]]] (* after T. D. Noe at A102531 *)

A332319 Imaginary part of Gaussian norm-multiply-perfect numbers, in order of increasing norm.

Original entry on oeis.org

0, 1, 3, 1, 2, 5, 4, 10, 16, 14, 2, 18, 22, 26, 18, 20, 41, 1, 36, 48, 24, 12, 65, 70, 24, 64, 82, 88, 45, 15, 100, 20, 94, 100, 130, 132, 84, 120, 184, 30, 148, 108, 32, 216, 192, 48, 228, 212, 51, 24, 252, 188, 60, 282, 283, 209, 312, 216, 198, 440, 102, 490
Offset: 1

Views

Author

Amiram Eldar, Feb 09 2020

Keywords

Comments

See A332318 (the corresponding real parts) for the definition of Gaussian norm-multiply-perfect numbers.

Crossrefs

Programs

  • Mathematica
    csigma[z_] := DivisorSigma[1, z, GaussianIntegers -> True]; normultPerf[z_] := Divisible[Abs[csigma[z]]^2, Abs[z]^2]; seq = {}; max = 10^2; Do[z = a + b*I; If[Abs[z] <= max && normultPerf[z], AppendTo[seq, {Abs[z]^2, z}]], {a, 1, max}, {b, 0, max}]; Im[Transpose[Sort[seq]][[2]]] (* after T. D. Noe at A102532 *)

A353151 A Gaussian integer analog of the sum-of-divisors function (see Comments lines for definition).

Original entry on oeis.org

1, 5, 4, 13, 10, 20, 8, 25, 13, 50, 12, 52, 20, 40, 40, 41, 26, 65, 20, 130, 32, 60, 24, 100, 61, 100, 40, 104, 40, 200, 32, 65, 48, 130, 80, 169, 50, 100, 80, 250, 52, 160, 44, 156, 130, 120, 48, 164, 57, 305, 104, 260, 68, 200, 120, 200, 80, 200, 60, 520, 74, 160
Offset: 1

Views

Author

Allan C. Wechsler, Apr 26 2022

Keywords

Comments

Definition: Multiplicative over the Gaussian integers. Factorize n into Gaussian prime factors whose imaginary part does not exceed their real part. Then, for each distinct Gaussian prime power factor p^k, calculate (1 + p + ... + p^k) = (p^(k+1) - 1) / (p - 1) ; multiply all these Gaussian prime power contributions to get a(n).
It is not clear if this is the same as Spira's complex sum-of-divisors function; see A102506.
This is a Gaussian sum of divisors function, in that it is a sum of one associate of each Gaussian divisor of n; it's just not clear that we choose the same associate as Spira does in all cases.
If m and n are relatively prime real integers, then they are relatively prime Gaussian integers, so this function is also multiplicative in the usual sense, over the real integers.
Note that under this sum-of-divisors function, 5 is analogically perfect, and 10 is analogically multiperfect with index 5, because a(5) = 10, and a(10) = 50.

Examples

			2 = (1+i)(1-i), so a(2) = (2+i)(2-i) = 5.
3 is already a Gaussian prime, so a(3) = 1 + 3 = 4.
4 = (1+i)^2 (1-i)^2, so a(4) = (1 + (1+i) + (1+i)^2) (1 + (1-i) + (1-i)^2)
  = (2+3i)(2-3i) = 13.
12 = 2^2 * 3, so by real multiplicativity (see comments), a(12) = 13 * 4 = 52.
		

Crossrefs

Analogic multiperfect numbers under a similar interpretation of sum of complex divisors: A102506, A102507.

Formula

Factorize n over the Gaussian integers into the form Product (p(i)^e(i)), where Re(p(i)) >= Im(p(i)). Then a(n) = Product (p(i)^(e(i)+1) - 1)/(p(i) - 1). (This has no imaginary part since it is a product of conjugate pairs.)

Extensions

More terms from David A. Corneth, Apr 27 2022
Showing 1-7 of 7 results.