11772613

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=18A054682
• a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=18A070018
• Prime numbersat n=774074