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-5 of 5 results.

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

Views

Author

Walter Nissen, Mar 09 2006

Keywords

Comments

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.

Examples

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

References

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

Crossrefs

Formula

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

Extensions

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

Views

Author

Walter Nissen, Mar 09 2006

Keywords

Comments

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?

Examples

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

References

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

Crossrefs

Formula

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

Extensions

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

Views

Author

Walter Nissen, Mar 09 2006

Keywords

Comments

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.

Examples

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

References

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

Crossrefs

Formula

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

Extensions

Offset corrected by Amiram Eldar, Mar 05 2020

A088818 Numbers k whose abundance-radius does not exceed log(log(k)), i.e., abs(sigma(k)-2*k) <= log(log(k)).

Original entry on oeis.org

6, 16, 28, 32, 64, 128, 256, 496, 512, 1024, 1952, 2048, 4096, 8128, 8192, 16384, 32768, 32896, 65536, 130304, 131072, 262144, 522752, 524288, 1048576, 2097152, 4194304, 8382464, 8388608, 16777216, 33550336, 33554432, 67108864, 134193152, 134217728, 268435456
Offset: 1

Views

Author

Labos Elemer, Oct 20 2003

Keywords

Examples

			The perfect numbers are all terms.
It is an infinite sequence since it includes all the powers of 2 (A000079) that are larger than 8 (as almost-perfect numbers).
		

Crossrefs

Programs

  • Mathematica
    abu[x_] := Abs[DivisorSigma[1, x]-2*x]; Do[If[ !Greater[abu[n], Log[Log[n]]//N], Print[n]], {n, 1, 1000000}]
  • PARI
    is(n) = n > 1 && abs(sigma(n)-2*n) < log(log(n)); \\ Amiram Eldar, Jul 24 2024

Extensions

a(28)-a(34) from Donovan Johnson, Dec 21 2008
a(35)-a(36) from Amiram Eldar, Jul 24 2024

A088820 Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.

Original entry on oeis.org

22, 56, 130, 184, 368, 836, 1012, 2272, 11096, 17816, 18904, 33664, 45356, 70564, 77744, 85936, 91388, 100804, 128768, 254012, 388076, 391612, 527872, 1090912, 2087936, 2291936, 13174976, 17619844, 29465852, 35021696, 45335936, 120888092, 260378492, 381236216
Offset: 1

Views

Author

Labos Elemer, Oct 20 2003

Keywords

Comments

Original definition: Abundance-radius=8, that is Abs[sigma[n]-2n]=8 (either +8 or -8). A045770 from 3rd term complemented by -8 cases.

Examples

			22 is in the sequence since sigma(22) = 1 + 2 + 11 + 22 = 36 = 2*22 - 8.
56 is in the sequence since sigma(56) = 1 + 2 + 4 + 7 + 8 + 14 + 28 + 56 = 120 = 2*56 + 8. - _Michael B. Porter_, Jul 20 2016
		

Crossrefs

Disjoint union of A088833 (abundance 8) and A125247 (deficiency 8).
Cf. A000203 (sigma), A033880 (abundance), A005100 (deficient numbers).

Programs

  • Magma
    [n: n in [1..2*10^7] | Abs(DivisorSigma(1, n) - 2*n) eq 8]; // Vincenzo Librandi, Jul 20 2016
  • Mathematica
    Select[Range[1, 10^6], Abs[DivisorSigma[1, #] - 2 #] == 8 &] (* Vincenzo Librandi, Jul 20 2016 *)
  • PARI
    is(n)=abs(sigma(n)-2*n)==8 \\ Use, e.g., select(is,[1..10^5]*2). - M. F. Hasler, Jul 19 2016
    

Extensions

More terms from David Wasserman, Aug 18 2005
Edited by M. F. Hasler, Jul 19 2016
a(33)-a(34) from Amiram Eldar, Mar 11 2025
Showing 1-5 of 5 results.