2541289

Properties

Appears in sequences

• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.at n=16A054682
• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=16A070018
• Least prime p introducing prime-difference pattern {d, 2*d}, where d = 2*n, i.e., {p, p+2*n, p+2*n+4*n} = {p, p+2*n, p+6*n} are consecutive primes.at n=16A079011
• Prime numbersat n=185877