3489660929

Appears in sequences

• a(n) = (n-1)*2^n + 1.at n=27A000337
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=28A051900
• a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=28A057775
• Duplicate of A051900.at n=28A084706
• Primes in A000337.at n=3A119531
• Least prime of the form 1 + p*2^n, where p is an odd prime.at n=27A134854
• a(n) = 2*a(n-1) - 1 with a(0)=14.at n=28A168596
• Primes of the form 2^r * 13^s + 1.at n=14A173236
• Odd prime factors of generalized Fermat numbers of the form 11^(2^m) + 1 with m >= 0.at n=16A273949
• Primes of the form 13*2^n + 1.at n=4A300406
• a(n) is the smallest prime p such that p - 1 has 2*n divisors.at n=28A340870
• Primes p such that the odd part of p - 1 is upper-bounded by the dyadic valuation of p - 1.at n=26A361180