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.

A054682

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.

Terms

    a(0) =3a(1) =89a(2) =47a(3) =1823a(4) =1627a(5) =199a(6) =5939a(7) =5591a(8) =15823a(9) =83117a(10) =259033a(11) =16763a(12) =365851a(13) =1074167a(14) =69593a(15) =1625027a(16) =2541289a(17) =255767a(18) =11772613a(19) =3312227a(20) =247099a(21) =23374859a(22) =25767389a(23) =3565931a(24) =21369059a(25) =15340943a(26) =6314393a(27) =59859131a(28) =101996837a(29) =4911251

External references