525313

Properties

Appears in sequences

• Largest prime factor of 2^n + 1.at n=38A002587
• a(n) = 2 * (4^n + 2^n) + 1.at n=9A085601
• Primes p such that the equation x^64 == -2 (mod p) has a solution, and ord_p(-2) is even.at n=21A163186
• Numbers k (between 2^(m-1) and 2^m) such that 2^(k-1) == 1 (mod k) and 2^(k-1-m) == k - 2^p (mod k) for some p > 0 with 2^p < k.at n=24A167612
• Expansion of (1 + 4*x - 6*x^2 - 16*x^3 + 20*x^4)/((1-x)*(1-2*x)*(1+2*x)*(1-2*x^2)).at n=19A171663
• Gaussian-Mersenne primes: primes of the form ((1+i)^p - 1)((1-i)^p - 1).at n=5A182300
• Generalized Gaussian-Mersenne primes (see below).at n=18A207040
• Largest prime factor of 4^(2*n+1)+1.at n=9A229747
• Largest prime factor of 2^(2*n+1)-2^(n+1)+1.at n=27A229767
• Largest prime factor of 2^(2*n+1)+2^(n+1)+1.at n=8A229768
• Prime(n), where n is such that (1+sum_{i=1..n} prime(i)^14) / n is an integer.at n=39A233043
• Number of pieces after a sheet of paper is folded n times and cut diagonally.at n=20A257418
• Primes whose anti-divisors sum to a prime.at n=34A259932
• Largest prime factor of 4^n + 1.at n=19A274903
• Largest prime factor of 4^n - 1.at n=37A274906
• Primes that have exactly 3 ones in both their binary and ternary expansions.at n=19A280997
• a(0)=2; for n > 0, a(n) = 2^(2*n-1) + 2^n + 1.at n=10A343175
• Odd primes whose base-2 representation has no proper substrings that are base-2 representations of odd primes.at n=29A365518
• Prime numbersat n=43465