[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A253850
Mersenne exponents (A000043) that are the sum of the divisors (A000203) of some n.
6
3, 7, 13, 31, 127
OFFSET
1,1
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
EXAMPLE
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.
PROG
(Magma) Set(Sort([SumOfDivisors(n): n in[1..10000] | IsPrime((2^SumOfDivisors(n))- 1)]));
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jaroslav Krizek, Jan 16 2015
STATUS
approved