110503

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=28A000043
• 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=18A001153
• Numbers n such that n is a substring of its square in base 8 (written in base 10).at n=25A018832
• Bisection of A000043.at n=14A099982
• Mersenne prime indices that are also Gaussian primes.at n=11A112633
• Duplicate of A112633.at n=11A145039
• Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 127 mod 6!.at n=8A145042
• Base-2 logarithm of A136007(n)+1.at n=19A152961
• Odd Mersenne exponents.at n=27A174265
• Numbers k such that exactly one of 2^k - 1 and 2^k + 1 is a prime.at n=32A174269
• 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=29A190213
• Prime numbers n such that 2^n-1 is prime and can be written in the form a^2+7*b^2.at n=15A216518
• Numbers k such that (36^k + 1)/37 is prime.at n=5A229145
• Numbers m such that 2^m + (-1)^m is prime.at n=32A285929
• Greater of twin primes p such that 2^p-1 is prime.at n=8A297674
• Numbers k such that 309*2^k+1 is prime.at n=43A323144
• Mersenne prime exponents p which are twin primes, so p-2 and/or p+2 is prime.at n=12A346645
• 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=12A354167
• Prime numbersat n=10489