OFFSET
1,2
COMMENTS
Conjecture : there is at least one k for each n.
LINKS
Pierre CAMI, Table of n, a(n) for n = 1..825
FORMULA
a(n) = A082466(2^n), n>1. - R. J. Mathar, Jul 20 2012
MAPLE
A205321 := proc(n)
local a, p ;
for a from 0 do
p := (2^n+a)*2^n-1 ;
if isprime(p) and isprime(p+2) then
return a;
end if;
end do:
end proc: # R. J. Mathar, Jul 18 2012
PROG
(PFGW64 and SCRIPTIFY)
SCRIPT
DIM nn, 0
DIM kk
DIMS tt
OPENFILEOUT myfile, a(n).txt
LABEL loopn
SET nn, nn+1
IF nn>825 THEN END
SET kk, -1
LABEL loopk
SET kk, kk+1
SETS tt, %d, %d\,; nn; kk
PRP (2^nn+kk)*2^nn-1, tt
IF ISPRP THEN GOTO a
IF ISPRIME THEN GOTO a
GOTO loopk
LABEL a
PRP (2^nn+kk)*2^nn+1, tt
IF ISPRP THEN GOTO d
IF ISPRIME THEN GOTO d
GOTO loopk
LABEL d
WRITE myfile, tt
GOTO loopn
Results in a(n).txt file
all kk values such that (2^nn+kk)*2^nn-1 is prime in pfgw-primes.log and pfgw.log files
CROSSREFS
KEYWORD
nonn
AUTHOR
Pierre CAMI, Jul 14 2012
STATUS
approved