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.

Previous Showing 11-12 of 12 results.

A154896 Sum of proper divisors minus the number of proper divisors of the perfect number A000396(n).

Original entry on oeis.org

3, 23, 487, 8115, 33550311, 8589869023, 137438691291, 2305843008139952067, 2658455991569831744654692615953842055, 191561942608236107294793378084303638130997321548169039
Offset: 1

Views

Author

Omar E. Pol, Jan 25 2009

Keywords

Comments

a(n) is also the difference between the n-th perfect number and its number of proper divisors.

Examples

			a(2) is 23 because the second perfect number is 28 and the sum of proper divisors of 28 is also 28 = 1+2+4+7+14 and the number of proper divisors of 28 is 5, then 28-5 = 23.
		

Crossrefs

Formula

a(n) = A152770(A000396(n)) = A000396(n)-A133033(n).

Extensions

More terms from Max Alekseyev, Dec 12 2011

A154895 Perfect numbers whose number of proper divisors is prime.

Original entry on oeis.org

6, 28, 8128, 137438691328, 2305843008139952128
Offset: 1

Views

Author

Omar E. Pol, Jan 25 2009

Keywords

Comments

The next term is too large to include in the data section. If there are no odd perfect numbers then the next term is a(6) = 2^606 * (2^607 - 1) = 1.410... * 10^365. - Amiram Eldar, Jul 29 2020

Examples

			28 is member because the number of proper divisors of 28 is 5, a prime number.
		

Crossrefs

Programs

  • Mathematica
    Table[2^(p-1)*(2^p-1), {p, Select[MersennePrimeExponent[Range[8]], PrimeQ[2# - 1] &]}] (* Amiram Eldar, Jul 29 2020 *)

Formula

a(n) = A006516(A172461(n)), assuming that odd perfect numbers do not exist. - Amiram Eldar, Jul 29 2020
Previous Showing 11-12 of 12 results.