Ultra useful primes: Difference between revisions
m
clarify
Thundergnat (talk | contribs) (New Draft Task and Raku example) |
Thundergnat (talk | contribs) m (clarify) |
||
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.
'''''k''' must always be an odd number since 2 to any power is always even.''
| |||