756839
domain: N
Properties
Primality
- Prime
- yes
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=31A000043
- 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=20A001153
- Bisection of A000043.at n=15A099983
- Mersenne prime indices that are also Gaussian primes.at n=13A112633
- Duplicate of A112633.at n=13A145039
- Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 607 mod 6!at n=2A145045
- Isolated primes p such that 2^p-1 is also a prime number.at n=17A161676
- Odd Mersenne exponents.at n=30A174265
- Numbers k such that exactly one of 2^k - 1 and 2^k + 1 is a prime.at n=35A174269
- 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=32A190213
- 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=13A216519
- Odious Mersenne exponents.at n=17A237499
- Numbers m such that 2^m + (-1)^m is prime.at n=35A285929
- 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=14A354167
- Prime numbersat n=60745