Ultra useful primes: Difference between revisions

m
Promote. multiple implementations, no questions
(Added Go)
m (Promote. multiple implementations, no questions)
Line 1:
{{draft task}}
 
An '''ultra-useful prime''' is a member of the sequence where each <span style="font-size:125%;">'''a(n)'''</span> is the smallest positive integer <span style="font-size:125%;">'''k'''</span> such that <span style="font-size:125%;">'''2<sup>(2<sup>n</sup>)</sup> - k'''</span> is prime.
10,327

edits