login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A108271
Consider primes p and q such that p = 2^k + 15 and q = 2^(k+1) + 15 for some k; sequence gives values of q.
1
19, 23, 31, 47, 79, 2063, 4111, 65551, 8388623
OFFSET
1,1
PROG
(PARI) g(m, n, b) = { for(x=0, n, y=m+b^x+b%2; z=m+b^(x+1)+b%2; if(isprime(y)&isprime(z), print1(y", ") ) ) }
(Magma) for k in [0..100] do p:=2^k+15; q:=2^(k+1)+15; if IsPrime(p) and IsPrime(q) then q; end if; end for;
CROSSREFS
Cf. A108266.
Sequence in context: A007639 A261311 A168144 * A351121 A245585 A343741
KEYWORD
nonn
AUTHOR
Cino Hilliard, Jun 29 2005
STATUS
approved