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.

A081357 Sublime numbers, numbers for which the number of divisors and the sum of the divisors are both perfect.

Original entry on oeis.org

12, 6086555670238378989670371734243169622657830773351885970528324860512791691264
Offset: 1

Views

Author

Michael Joseph Halm, Apr 20 2003

Keywords

Comments

The concept was introduced and the term "sublime numbers" was coined by Kevin Brown. a(1) was found by Brown (1995) and a(2) by Hickerson (1995). - Amiram Eldar, Jun 26 2021
a(2) = 2^126 * M(3) * M(5) * M(7) * M(19) * M(31) * M(61), where M(n) = 2^n - 1. - Lucas A. Brown, Mar 05 2025
It is known that all sublime numbers must be of that form, with all odd prime factors being Mersenne primes M(p). - M. F. Hasler, Mar 05 2025

Examples

			a(1) = 12 because 12 + 6 + 4 + 3 + 2 + 1 = 28 is perfect and number of divisors, 6, is also perfect.
		

References

  • David J. Darling, The universal book of mathematics: from Abracadabra to Zeno's paradoxes, Hoboken, N.J.: Wiley, 2004, p. 307.
  • Jean-Marie De Koninck, Those Fascinating Numbers, Amer. Math. Soc., 2009, pp. 4 and 395.
  • Roozbeh Hazrat, Mathematica®: A Problem-Centered Approach, Springer, 2016, exercise 5.5, p. 102.
  • Clifford A. Pickover, Wonders of Numbers: Adventures in Mathematics, Mind, and Meaning, Oxford University Press, 2001, p. 215.
  • József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 1, p. 22.
  • Simon Singh, The Simpsons and Their Mathematical Secrets, A&C Black, 2013, p. 98.

Crossrefs