A117349 -id:A117349 - cp's OEIS frontend

A171929 Odd numbers whose abundancy is closer to 2 than any smaller odd number.

1, 3, 9, 15, 45, 105, 315, 1155, 7425, 8415, 8925, 31815, 32445, 351351, 442365, 13800465, 14571585, 16286445, 20355825, 20487159, 78524145, 132701205, 159030135, 815634435, 2586415095, 29169504045, 40833636525, 125208115065

Offset: 1

Sergio Pimentel, Jan 05 2010

The (relative) abundancy of n is sigma(n)/n, not sigma(n) - 2n. - M. F. Hasler, Apr 12 2015 [As far as I know, "abundancy" has only this meaning; the much less useful sigma(n) - 2n is called "abundance". - Charles R Greathouse IV, Feb 19 2017]
So far all known perfect numbers (abundancy = 2) are even, cf. A000396 = (6, 28, 496, 8128, ...). It has been conjectured but not proved that there are no odd perfect numbers. This sequence provides the list of odd numbers that approach perfection (odd numbers which abundancy is closer to two than the abundancy of any smaller odd number).
Odd numbers n such that abs(sigma(n)/n-2) < abs(sigma(m)/m-2) for all m < n. That is, each n is closer to being an odd perfect number than the preceding n. Interestingly, if abs(sigma(n)/n-2) is expressed as a reduced fraction, the numerator of the fraction is 2 for 25 out of the first 30 terms. Terms a(29) and a(30) are 127595519865 and 154063853475. - T. D. Noe, Jan 28 2010
Indices of successive minima in the sequence |A000203(n)/n - 2| for odd n. The sequence would terminate at the smallest odd perfect number (if it exists). - Max Alekseyev, Jan 26 2010
This sequence is finite if and only there is an odd perfect number. "If" is evident. "Only if" follows because for any real number r > 1 there is an odd number m relatively prime to a given integer such that 1 < sigma(m)/m < r. For example, take a large enough prime. - Charles R Greathouse IV, Dec 13 2016, corrected Feb 19 2017
Of the initial 40 terms, only term 45 is in A228058 (and also in A228059). - Antti Karttunen, Jan 04 2025

			Example: a(8) = 1155 since sigma(1155)/1155 = 1.9948 which is closer to 2 than any smaller a(n).

Giovanni Resta, Table of n, a(n) for n = 1..40 (terms < 10^13; first 36 terms from T. D. Noe)
Mathworld, Abundancy.
Index entries for sequences where odd perfect numbers must occur, if they exist at all.

Cf. A000203, A000396 (perfect numbers), A053624, A119239, A088012, A117349; A188263 and A188597 (the same but restricted to only abundant resp. deficient numbers).

Cf. also A088012, A228058, A228059.

minDiff=Infinity; k=-1; Table[k=k+2; While[abun=DivisorSigma[1,k]/k; Abs[2-abun] > minDiff, k=k+2]; minDiff=Abs[2-abun]; k, {15}] (* T. D. Noe, Jan 28 2010 *)

m=2; forstep(n=1,10^10,2, t=abs(sigma(n)/n - 2); if(tMax Alekseyev, Jan 26 2010

Name improved by T. D. Noe, Jan 28 2010

More terms from Max Alekseyev, T. D. Noe and J. Mulder (jasper.mulder(AT)planet.nl), Jan 26 2010

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

cp's OEIS Frontend

A171929 Odd numbers whose abundancy is closer to 2 than any smaller odd number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

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

References

Links

Crossrefs

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions