OFFSET
1,1
COMMENTS
There are no 10-digit terms because their sum of digits would be 45 and thus the number would be divisible by 3.
There are 25332 terms in this sequence, the last of which is 987653201, as found by Harvey P. Dale. - see Martin Gardner's column in Scientific American.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..25332 (full sequence).
Chris K. Caldwell and G. L. Honaker, Jr., 987653201, Prime Curios!.
Martin Gardner, Patterns in primes are a clue to the strong law of small numbers, Mathematical Games, Scientific American, Vol. 243, No. 4, September, 1980.
Carlos Rivera, Puzzle 59. Six and the nine digits primes (by Jud McCranie), The Prime Puzzles and Problems Connection.
MAPLE
read(transforms): A046732 := proc(n) option remember: local d, k, p, distdig: if(n=1)then return 2: fi: p:=procname(n-1): do p:=nextprime(p): if(isprime(digrev(p)))then d:=convert(p, base, 10): distdig:=true: for k from 0 to 9 do if(numboccur(d, k)>1)then distdig:=false: break: fi: od: if(distdig)then return p: fi: fi: od: end: seq(A046732(n), n=1..52); # Nathaniel Johnston, May 29 2011
MATHEMATICA
Select[Prime[Range[280]], Length[Union[x = IntegerDigits[#]]] == Length[x] && PrimeQ[FromDigits[Reverse[x]]] &] (* Jayanta Basu, Jun 28 2013 *)
PROG
(Python)
from sympy import prime, isprime
A046732 = [p for p in (prime(n) for n in range(1, 10**3)) if len(str(p)) == len(set(str(p))) and isprime(int(str(p)[::-1]))] # Chai Wah Wu, Aug 14 2014
CROSSREFS
KEYWORD
easy,nonn,fini,full,base
AUTHOR
EXTENSIONS
More terms from Jud McCranie.
STATUS
approved