A152079 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A152079

Primes p such that A000695(p) are also prime.

3, 5, 17, 23, 29, 43, 47, 53, 61, 83, 107, 139, 149, 151, 173, 179, 181, 191, 229, 233, 239, 257, 263, 269, 277, 307, 353, 379, 383, 389, 409, 439, 443, 449, 479, 503, 563, 569, 631, 647, 653, 661, 673, 743, 787, 823, 863, 877, 929, 967, 983

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Numbers a(n) are in A077718. Conjecture: The sequence contains infinitely many terms.

Supporting the conjecture, there are 8398 terms up to a million, 56915 up to 10 million, 407875 terms up to 100 million, and 3135962 terms up to a billion. - Charles R Greathouse IV, Apr 28 2015

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

PROG

(PARI) A000695(n)=n=binary(n); sum(i=1, #n, n[i]*4^(#n-i))

is(n)=isprime(A000695(n)) && isprime(n) \\ Charles R Greathouse IV, Apr 28 2015

CROSSREFS

Cf. A000695, A077718, A152021, A152022, A152023, A152078.

Sequence in context: A326653 A218624 A152078 * A027699 A153417 A069687

Adjacent sequences: A152076 A152077 A152078 * A152080 A152081 A152082

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, Nov 23 2008

EXTENSIONS

More terms derived from b000695.txt by Michel Marcus, Jun 02 2013

STATUS

approved