cp's OEIS Frontend

Also numbers n such that sigma(n) is in A000043, i.e., p = 2^sigma(n) - 1 is a Mersenne prime (A000668). The sequence of corresponding primes p reads: 7, 127, 8191, 2147483647, 2147483647, 170141183460469231731687303715884105727, ..., see A253851.

Subsequence of A023194 (numbers n such that sigma(n) is a prime), see there for an explanation why all terms except the first one are squares.

The sequence of values of sigma(a(n)) is 3, 7, 13, 31, 31, 127, ... and each term of this sequence must be a prime from the sequence of Mersenne exponents (A000043). See A253850.

Sequence differs from A023194 because A023194(7) = 289 but if a(7) exists, it must be a number n such that sigma(n) > A000043(43) = 30402457.

a(n) must be an even power of a prime. If it is the square of an odd prime, then this prime must be in A053182. If a(n) is an even power of 2, a(n)=2^(2k), then sigma(a(n))=2^(2k+1)-1. Thus, 2k+1 must be a double Mersenne prime exponent, i.e., such that the corresponding Mersenne prime is again a Mersenne exponent, cf. A103901. Only 4 such primes are known, and a(6)=2^6 (k=3) corresponds to the largest known prime of this type, 2^(2k+1)-1 = 127. - M. F. Hasler, Jan 21 2015

Only four terms are known.

The first four Mersenne primes (p=2^q-1 in A000668) are double Mersenne primes, i.e., in A103901. The next four yield a composite M(p) and therefore are in this sequence. The next larger Mersenne prime p = A000668(9) has already 19 digits and is much too large to enable us, as of today, to test the primality of 2^p-1 (which would require over 10^8 gigabytes just to be stored in binary). This explains that only 4 terms are known of this sequence and of A103901; for all the 30+ remaining members of A000668 it is not known whether they belong to A103901 or to this sequence A103902. - M. F. Hasler, Jan 21 2015

The terms of this sequence are sometimes called "Double Mersenne numbers" (cf. A263686).

Agrees with A077586 in the first four terms, but then the two sequences differ for the first time at n = 5, because prime(5) = 11 is not in A000043.

a(5) is too large to include in data section (see A276641).

a(n) = A263686(n) iff a(n) is prime, which is the case iff A000668(n) is in A103901.

Agrees with A263686 at least in the first four terms. - Omar E. Pol, Oct 24 2016