114689

Properties

Appears in sequences

• a(n) = n*2^(n-1) + 1.at n=14A005183
• Prime factors of Fermat numbers.at n=6A023394
• Primes of the form n*2^phi(n)+1 with phi the Euler function.at n=10A046154
• Primes of form 7*2^n+1.at n=3A050527
• a(n) = n*4^n + 1.at n=7A050915
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=14A051900
• a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=14A057775
• Primes p such that cototient(totient(p)) = A070556(p) is a power of 2.at n=16A070806
• Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).at n=15A073919
• Primes of the form 2^r*7^s + 1.at n=13A077498
• Expansion of (1-x)^(-1)/(1+2*x-2*x^3).at n=30A077924
• a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.at n=14A083686
• Duplicate of A051900.at n=14A084706
• Let p run through the primes; write p in base 10 and then interpret it in base 128 getting a number q; if q is prime then adjoin q to the sequence.at n=28A090718
• Smallest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.at n=12A093179
• Squarefree products of factors of Fermat numbers (A023394).at n=24A094358
• Anti-elite primes: a prime number p is called anti-elite if only a finite number of Fermat numbers 2^(2^n)+1 are quadratic non-residues mod p.at n=19A128852
• Least prime of the form 1 + p*2^n, where p is an odd prime.at n=13A134854
• a(1) = 1, a(n) = the smallest prime divisor of A138793(n).at n=48A138962
• Primes of the form 2^j - 2^k + 1, where j > k >= 0.at n=35A152449