OFFSET
1,1
COMMENTS
More precisely, "... remains prime under two iterations of base-10 to base-2 conversions, but not three iterations."
.
LINKS
Sebastian Petzelberger, Table of n, a(n) for n = 1..10000.
Carlos Rivera, Puzzle 280. 3893257, The Prime Puzzles & Problems Connection.
EXAMPLE
5 is a term because 5_10 = 101_2 and 101_10 = 1100101_2 and both 101 and 1100101 are prime in base 10.
MATHEMATICA
okQ[n_] := And @@ PrimeQ[Rest[NestList[FromDigits[IntegerDigits[#, 2]] &, n, 2]]]; Select[Prime[Range[20000]], okQ] (* Harvey P. Dale, Jan 14 2011 *)
PROG
(PARI) A007088(n)=fromdigits(binary(n), 10)
is(n)=isprime(n) && isprime(n=A007088(n)) && isprime(A007088(n)) \\ Charles R Greathouse IV, Apr 08 2015
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Martin Raab, Oct 09 2006
STATUS
approved