6972593

Properties

Appears in sequences

• Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=37A000043
• Degrees of primitive irreducible trinomials: n such that 2^n - 1 is a Mersenne prime and x^n + x^k + 1 is a primitive irreducible polynomial over GF(2) for some k with 0 < k < n.at n=23A001153
• Bisection of A000043.at n=18A099983
• Mersenne prime indices that are not Gaussian primes.at n=22A112634
• Primes p such that 2^p-1 is prime and congruent to 31 mod 5!.at n=21A145040
• Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 31 mod 6!.at n=14A145041
• Base-2 logarithm of A136007(n)+1.at n=24A152961
• Isolated primes p such that 2^p-1 is also a prime number.at n=23A161676
• Odd Mersenne exponents.at n=36A174265
• Numbers k such that exactly one of 2^k - 1 and 2^k + 1 is a prime.at n=41A174269
• Prime numbers n such that 2^n-1 is a prime that cannot be written in the form a^2+7*b^2.at n=18A216519
• Odious Mersenne exponents.at n=20A237499
• Numbers m such that 2^m + (-1)^m is prime.at n=41A285929
• Lower of two consecutive Mersenne prime exponents with record first difference.at n=18A298943
• Let M_p = 2^p-1 be a Mersenne prime, where p is an odd prime. Sequence lists p such that b_{p-2} == 2^((p+1)/2) mod M_p, where {b_k} is defined in the Comments.at n=18A354167
• Prime numbersat n=474908