|
|
A275767
|
|
Numbers k for which 2*4^k - 27 is prime.
|
|
3
|
|
|
2, 3, 9, 11, 291, 1263, 2661, 3165, 8973, 8999, 27479
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The prime numbers that these exponents generate are given in A275749.
Since 2*4^(2k) - 27 = 2*16^k - 27 == (2*1^k - 27) mod 5 = -25 mod 5 == 0 mod 5, no even number greater than 2 will be in this sequence.
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 2, since 2*4^2 - 27 = 32 - 27 = 5, which is prime.
a(2) = 3, since 2*4^3 - 27 = 128 - 27 = 101, which is prime.
a(3) = 9, since 2*4^9 - 27 = 524288 - 27 = 524261, which is prime.
a(4) = 11, since 2*4^11 - 27 = 8388608 - 27 = 8388581, which is prime.
|
|
MATHEMATICA
|
|
|
PROG
|
(Python)
from sympy import isprime
def afind(limit, startk=2):
alst, pow4 = [], 4**startk
for k in range(startk, limit+1):
if isprime(2*pow4 - 27): print(k, end=", ")
pow4 *= 4
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|