40961

Properties

Appears in sequences

• Smallest prime containing n-th cube as substring.at n=16A029949
• Smallest nontrivial extension of n-th cube which is a prime.at n=15A030692
• Smallest prime of form 2^n*k + 1.at n=13A035089
• a(n) = T(7,n), array T given by A048472.at n=10A048479
• Primes of form 5*2^n+1.at n=3A050526
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=13A051900
• a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=13A057775
• Smallest prime p such that n = A049108(p) = length of chain of iterates of Euler Phi starting with p.at n=15A060611
• Primes which can be expressed as concatenation of powers of 4 and 0's.at n=22A066595
• Primes that can be formed by concatenating 2^a and 3^b.at n=33A068801
• Smallest prime larger than 2^n whose digits begin with those of 2^n.at n=12A068842
• Smallest prime with same leading digits as 8^n.at n=4A068848
• Primes of form 2^x + 2^y + 1.at n=34A070739
• 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=14A073919
• Primes of the form 512*k+1.at n=16A076339
• Primes of the form 2^r*5^s + 1.at n=15A077497
• Primes of the form 2^i + 2^j + 1, i > j > 0.at n=30A081091
• Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.at n=7A081546
• Primes p such that p*(p-1) divides 3^(p-1)-1.at n=34A081763
• Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=15A082605