365851

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=12A054682
• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=12A070018
• Largest prime < 10*a(n-1), a(1)=37.at n=4A124337
• Primes p such that q-p = 52, where q is the next prime after p.at n=20A204665
• Prime numbersat n=31212