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.

A253850 Mersenne exponents (A000043) that are the sum of the divisors (A000203) of some n.

Original entry on oeis.org

3, 7, 13, 31, 127
Offset: 1

Views

Author

Jaroslav Krizek, Jan 16 2015

Keywords

Comments

Also primes p that are the sum of the divisors of some n where 2^sigma(n) - 1 is a Mersenne prime (A000668).
Intersection of A023195 and A000043.
If a(6) exists, it must be greater than A000043(48) = 57885161, and also not equal to any of the Mersenne prime exponents 74207281, 77232917, 82589933, 136279841. - Gord Palameta, Oct 22 2024

Examples

			Mersenne exponent 7 is in the sequence because sigma(4) = 7.
Mersenne exponent 31 is in the sequence because there are two numbers n (16 and 25) with sigma(n) = 31.
		

Crossrefs

Programs

  • Magma
    Set(Sort([SumOfDivisors(n): n in[1..10000] | IsPrime((2^SumOfDivisors(n))- 1)]));