A088007 -id:A088007 - cp's OEIS frontend

A088012 Odd solutions to abs(sigma(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k).

1155, 8925, 32445, 442365, 159030135, 815634435, 2586415095, 1956860570050575, 221753180448460815, 747406020889133775

Offset: 1

Labos Elemer and Farideh Firoozbakht, Oct 20 2003

This sequence should include odd perfect numbers too, if they exist.
From Walter Nissen, Dec 15 2005: (Start)
     abundancy(k)             k            2k       sigma(k)  abundance
   1.99480519480519         1155          2310          2304      -6
   2.00067226890756         8925         17850         17856       6
   2.00018492834027        32445         64890         64896       6
   2.00001356346004       442365        884730        884736       6
   2.00000011318610    159030135     318060270     318060288      18
   1.99999999264376    815634435    1631268870    1631268864      -6
   2.00000000695943   2586415095    5172830190    5172830208      18
As it happens, abundance of these is -6, 6 or 18. This is not necessarily true for larger terms. (End)
See also A171929 and A188597 and A188263 for sequences of numbers (any / deficient / abundant) whose relative abundancy tends to 2. - M. F. Hasler, Feb 19 2017
3278298202600507814120339275775985 is also a term with abundance 30. In fact, it and 815634435 are the only odd terms known where abs(sigma(k)-2k) <= log_10(k). - Alexander Violette, Nov 05 2020; updated by Max Alekseyev, Jul 27 2025
Also includes 827880257692739174385 and 255286886041240176056063754225. - Max Alekseyev, Jul 27 2025

			1155 is in the sequence because sigma(1155) = 2304, giving 2*1155 - 2304 = 6, while natural log of 1155 is about 7.05.
From _M. F. Hasler_, Jul 18 2016: (Start)
We have the following factorizations:
1155 = 3 * 5 * 7 * 11,
8925 = 3 * 5^2 * 7 * 17,
32445 = 3^2 * 5 * 7 * 103,
442365 = 3 * 5 * 7 * 11 * 383,
159030135 = 3^5 * 5 * 11 * 73 * 163,
815634435 = 3 * 5 * 7 * 11 * 547 * 1291,
2586415095 = 3^2 * 5 * 11 * 31 * 41 * 4111.
The sequence appears to be a subsequence of A171929. (End)

Index entries for sequences where odd perfect numbers must occur, if they exist at all

Cf. A000079, A000396, A005100, A005101, A077374, A087167, A088007-A088011.

Cf. also A171929, A188263, A188597, A228059, A295296.

abu[x_] := Abs[DivisorSigma[1, x]-2*x] Do[If[ !Greater[abu[n], Log[n]//N]&&OddQ[n], Print[n]], {n, 1, 100000}]

is(n)=n%2 && abs(sigma(n)-2*n)<=log(n) \\ Charles R Greathouse IV, Feb 21 2017

a(7) from Donovan Johnson, Dec 21 2008

a(9) from Alexander Violette confirmed and a(8), a(10) added by Max Alekseyev, Jul 27 2025

A088011 Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).

Original entry on oeis.org

4, 6, 8, 10, 16, 20, 28, 32, 64, 70, 88, 104, 110, 128, 136, 152, 256, 464, 496, 512, 592, 650, 884, 1024, 1155, 1888, 1952, 2048, 2144, 4030, 4096, 5830, 8128, 8192, 8384, 8925, 11096, 16384, 17816, 18632, 18904, 32128, 32445, 32768, 32896, 33664, 45356

Offset: 1

Labos Elemer, Oct 20 2003

nonn

See A088012 for the subsequence of odd terms, only 7 being known up to 10^13. - M. F. Hasler, Feb 21 2017

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A088007-A088012, A077374, A005100, A005101, A000079, A000396.

abu[x_] := Abs[DivisorSigma[1, x]-2*x] Do[If[ !Greater[abu[n], Log[n]//N], Print[n]], {n, 1, 100000}]

(is(n)=abs(sigma(n)-2*n)M. F. Hasler, Feb 21 2017

A088008 Solutions to sigma(x) - 2x <= x^(1/3), both even and odd. Abundance-radius = abs(sigma(n)-2n) does not exceed 3rd root of n.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 16, 20, 28, 32, 64, 70, 88, 104, 110, 128, 136, 152, 256, 315, 464, 496, 512, 592, 650, 836, 884, 1012, 1024, 1155, 1696, 1758, 1842, 1866, 1878, 1888, 1902, 1952, 1986, 2022, 2048, 2082, 2094, 2118, 2144, 2154, 2202, 2238, 2272, 2274, 2298

Offset: 1

Labos Elemer, Oct 20 2003

nonn

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A077374, A088007-A088012, A000396, A000079, A005100, A005101.

abu[x_] := Abs[DivisorSigma[1, x]-2*x] Do[If[ !Greater[abu[n], n^(1/3)//N], Print[n]], {n, 1, 100000}]
Select[Range[2300],Abs[DivisorSigma[1,#]-2#]<=CubeRoot[#]&] (* Harvey P. Dale, Feb 22 2023 *)

A088010 Odd numbers n such that abs(sigma(n)-2n) <= n^(1/3). Abundance-radius = abs(sigma(n)-2n) does not exceed cubic root of n and n is odd.

Original entry on oeis.org

1, 315, 1155, 8415, 8925, 31815, 32445, 33705, 34335, 78975, 351351, 430815, 437745, 442365, 449295, 730125, 1805475, 7667625, 13800465, 14571585, 16029405, 16286445, 20297745, 20355825, 20487159, 21003885, 22982505, 23082885

Offset: 1

Labos Elemer, Oct 20 2003

nonn

Donovan Johnson, Table of n, a(n) for n = 1..100

Cf. A077374, A088007-A088012, A000396, A000079, A005100, A005101.

abu[x_] := Abs[DivisorSigma[1, x]-2*x] Do[If[ !Greater[abu[n], n^(1/3)//N]&&OddQ[n], Print[n]], {n, 1, 100000}]

isok(n) = (n % 2) && (abs(sigma(n)-2*n) < sqrtn(n, 3)); \\ Michel Marcus, Nov 10 2017

a(17)-a(28) from Donovan Johnson, Feb 01 2009

A117346 Near-multiperfects: numbers m such that abs(sigma(m) mod m) <= log(m).

Original entry on oeis.org

1, 3, 4, 5, 6, 7, 8, 10, 11, 13, 16, 17, 19, 20, 23, 28, 29, 31, 32, 37, 41, 43, 47, 53, 59, 61, 64, 67, 70, 71, 73, 79, 83, 88, 89, 97, 101, 103, 104, 107, 109, 110, 113, 120, 127, 128, 131, 136, 137, 139, 149, 151, 152, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199

Offset: 1

Walter Nissen, Mar 09 2006

nonn

Sequences A117346 through A117350 are an attempt to improve on sequences A045768 through A045770, A077374, A087167, A087485 and A088007 through A088012 and related sequences (but not to replace them) by using a more significant definition of "near." E.g., is sigma(n) really "near" a multiple of n, for n=9? Or n=18? Sigma is the sum_of_divisors function.

			70 is in the sequence because sigma(70) = 144 = 2*70 + 4, while 4 < log(70) ~= 4.248.

R. K. Guy, Unsolved Problems in Number Theory, B2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Multiperfect Number.

Cf. A045768 through A045770, A077374, A087167, A087485, A088007 through A088012, A117347 through A117350.

asmlQ[n_]:=Module[{p=Mod[DivisorSigma[1,n],n]},If[p>n/2,p=n-p];p<=Log[n]];
Select[Range[200],asmlQ] (* Harvey P. Dale, Dec 25 2013 *)

First term prepended by Harvey P. Dale, Dec 25 2013

A117349 Near-multiperfects with primes, powers of 2 and 6 * prime excluded, abs(sigma(n) mod n) <= log(n).

Original entry on oeis.org

6, 10, 20, 28, 70, 88, 104, 110, 120, 136, 152, 464, 496, 592, 650, 672, 884, 1155, 1888, 1952, 2144, 4030, 5830, 8128, 8384, 8925, 11096, 17816, 18632, 18904, 30240, 32128, 32445, 32760, 32896, 33664, 45356, 70564, 77744, 85936, 91388, 100804, 116624

Offset: 1

Walter Nissen, Mar 09 2006

nonn

Sequences A117346 through A117350 are an attempt to improve on sequences A045768 through A045770, A077374, A087167, A087485 and A088007 through A088012 and related sequences (but not to replace them) by using a more significant definition of "near." E.g., is sigma(n) really "near" a multiple of n, for n=9? Or n=18? Log is the natural logarithm. Sigma is the sum_of_divisors function.

			70 is a term because sigma(70) = 144 = 2*70 + 4, while 4 < log(70) ~= 4.248.

R. K. Guy, Unsolved Problems in Number Theory, B2.

Donovan Johnson, Table of n, a(n) for n = 1..180 (terms <= 10^12)
Eric Weisstein's World of Mathematics, Multiperfect Number

Cf. A045768, A045769, A045770, A077374, A087167, A087485.
Cf. A088007, A088008, A088009, A088010, A088011, A088012.
Cf. A117346, A117347, A117348, A117350.

sigma(n) = k*n + r, abs(r) <= log(n).

Offset corrected by Donovan Johnson, Oct 01 2012

A117350 Near-multiperfects with primes, powers of 2, 6 * prime and 2^n * prime excluded, abs(sigma(n) mod n) <= log(n).

Original entry on oeis.org

70, 110, 120, 650, 672, 884, 1155, 4030, 5830, 8925, 11096, 17816, 18632, 18904, 30240, 32445, 32760, 45356, 70564, 77744, 85936, 91388, 100804, 116624, 244036, 254012, 388076, 391612, 430272, 442365, 523776, 1090912, 1848964, 2178540

Offset: 1

Walter Nissen, Mar 09 2006

nonn

Sequences A117346 through A117350 are an attempt to improve on sequences A045768 through A045770, A077374, A087167, A087485 and A088007 through A088012 and related sequences (but not to replace them) by using a more significant definition of "near." E.g., is sigma (n) really "near" a multiple of n, for n=9? Or n=18? Sigma is the sum_of_divisors function.

			70 is in the sequence because sigma(70) = 144 = 2*70 + 4, while 4 < log(70) ~= 4.248.
The 2-perfect numbers are excluded because they are 2^n * prime.

R. K. Guy, Unsolved Problems in Number Theory, B2.

Donovan Johnson, Table of n, a(n) for n = 1..114 (terms <= 10^12)
Eric Weisstein's World of Mathematics, Multiperfect Number.

Cf. A045768 through A045770, A077374, A087167, A087485, A088007 through A088012, A117346 through A117349.

Offset corrected by Donovan Johnson, Oct 01 2012

A117347 Near-multiperfects with primes excluded, abs(sigma(m) mod m) <= log(m).

Original entry on oeis.org

4, 6, 8, 10, 16, 20, 28, 32, 64, 70, 88, 104, 110, 120, 128, 136, 152, 256, 464, 496, 512, 592, 650, 672, 884, 1024, 1155, 1888, 1952, 2048, 2144, 4030, 4096, 5830, 8128, 8192, 8384, 8925, 11096, 16384, 17816, 18632, 18904, 30240, 32128, 32445, 32760, 32768

Offset: 1

Walter Nissen, Mar 09 2006

nonn

Sequences A117346 through A117350 are an attempt to improve on sequences A045768 through A045770, A077374, A087167, A087485 and A088007 through A088012 and related sequences (but not to replace them) by using a more significant definition of "near". E.g., is sigma(n) (where sigma is the sum-of-divisors function) really "near" a multiple of n, for n = 9? Or n = 18?

			70 is a term because sigma(70) = 144 = 2 * 70 + 4, while 4 < log(70) ~= 4.248.

R. K. Guy, Unsolved Problems in Number Theory, B2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Walter Nissen, Near Multiperfects.
Eric Weisstein's World of Mathematics, Multiperfect Number

Cf. A045768, A045769, A045770, A077374, A087167, A087485.
Cf. A088007, A088008, A088009, A088010, A088011, A088012.
Cf. A117346, A117348, A117349, A117350.

sigma(m) = k * m + r, abs(r) <= log(m).

Offset corrected by Amiram Eldar, Mar 05 2020

A117348 Near-multiperfects with primes and powers of 2 excluded, abs(sigma(m) mod m) <= log(m).

Original entry on oeis.org

6, 10, 20, 28, 70, 88, 104, 110, 120, 136, 152, 464, 496, 592, 650, 672, 884, 1155, 1888, 1952, 2144, 4030, 5830, 8128, 8384, 8925, 11096, 17816, 18632, 18904, 30240, 32128, 32445, 32760, 32896, 33664, 45356, 70564, 77744, 85936, 91388, 100804, 116624

Offset: 1

Walter Nissen, Mar 09 2006

nonn

Sequences A117346 through A117350 are an attempt to improve on sequences A045768 through A045770, A077374, A087167, A087485 and A088007 through A088012 and related sequences (but not to replace them) by using a more significant definition of "near". E.g., is sigma(n) really "near" a multiple of n, for n = 9? Or n = 18? Sigma is the sum_of_divisors function.

			70 is a term because sigma(70) = 144 = 2 * 70 + 4, while 4 < log (70) ~= 4.248.

R. K. Guy, Unsolved Problems in Number Theory, B2.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Walter Nissen, Near Multiperfects.
Eric Weisstein's World of Mathematics, Multiperfect Number

Cf. A045768, A045769, A045770, A077374, A087167, A087485.
Cf. A088007, A088008, A088010, A088011, A088012.
Cf. A117346, A117347, A117349, A117350.

sigma(n) = k * n + r, abs(r) <= log(n).

Offset corrected by Amiram Eldar, Mar 05 2020

A087415 Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.

Original entry on oeis.org

1, 315, 945, 1155, 2205, 7425, 8415, 8925, 9405, 9555, 24885, 26145, 26325, 28035, 30555, 31815, 32445, 33705, 34335, 35595, 40005, 40365, 41265, 43155, 46035, 49875, 51765, 55335, 78975, 80535, 83265, 91455, 96915, 101475, 106425, 130815, 191565, 338415

Offset: 1

Labos Elemer, Oct 20 2003

nonn

Donovan Johnson, Table of n, a(n) for n = 1..1000

Intersection of A005408 and A088007.

Cf. A077374, A088008-A088012, A000396, A000079, A005100, A005101.

abu[x_] := Abs[DivisorSigma[1, x]-2*x]; Do[If[ !Greater[abu[n], Sqrt[n]//N]&& OddQ[n], Print[n]], {n, 1, 100000}]

isok(k) = k % 2 && (sigma(k)-2*k)^2 <= k; \\ Amiram Eldar, Mar 02 2025

cp's OEIS Frontend

A088012 Odd solutions to abs(sigma(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A088011 Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A088008 Solutions to sigma(x) - 2x <= x^(1/3), both even and odd. Abundance-radius = abs(sigma(n)-2n) does not exceed 3rd root of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A088010 Odd numbers n such that abs(sigma(n)-2n) <= n^(1/3). Abundance-radius = abs(sigma(n)-2n) does not exceed cubic root of n and n is odd.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A117346 Near-multiperfects: numbers m such that abs(sigma(m) mod m) <= log(m).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A117349 Near-multiperfects with primes, powers of 2 and 6 * prime excluded, abs(sigma(n) mod n) <= log(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions

A117350 Near-multiperfects with primes, powers of 2, 6 * prime and 2^n * prime excluded, abs(sigma(n) mod n) <= log(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A117347 Near-multiperfects with primes excluded, abs(sigma(m) mod m) <= log(m).

Views

Author

Keywords

Comments

Examples