86243

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=27A000043
• Bisection of A000043.at n=13A099983
• Mersenne prime indices that are also Gaussian primes.at n=10A112633
• Duplicate of A112633.at n=10A145039
• Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 607 mod 6!at n=1A145045
• Isolated primes p such that 2^p-1 is also a prime number.at n=15A161676
• Numbers k such that Sum_{i=1..k} i^9 divides Product_{i=1..k} i^9.at n=25A166609
• Odd Mersenne exponents.at n=26A174265
• Numbers k such that exactly one of 2^k - 1 and 2^k + 1 is a prime.at n=31A174269
• Integers m such that m divides (2^m-2)^2 and (m-2)^((k-1)*(1+k*(m-1))) == 1 (mod k), where k = 2^m - 1.at n=28A190213
• Primes of the form 7n^2 - 4.at n=11A201850
• 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=12A216519
• Numbers m such that 2^m + (-1)^m is prime.at n=31A285929
• G.f. A(x) satisfies: A(x) = (1 - x) / (1 - 2 * x - x^2 - x^3 * A(x)).at n=12A349186
• 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=11A354167
• Prime numbers preceded by two consecutive numbers which are products of four distinct primes (or tetraprimes).at n=40A361796
• Prime numbersat n=8384