OFFSET
2,1
COMMENTS
All primes show up in the sequence eventually.
LINKS
Amiram Eldar, Table of n, a(n) for n = 2..10000
EXAMPLE
11_10 = 23_4, reverse(23) = 32, 32_4 = 14_10, so a(4) = 11 since this does not work for smaller primes.
MATHEMATICA
a = {}; Do[k = 1; While[ PrimeQ[ FromDigits[ Reverse[ IntegerDigits[ Prime[k], n]], n]], k++ ]; a = Append[a, Prime[k]], {n, 2, 70}]; a
PROG
(PARI) a(n) = my(p=2); while (isprime(fromdigits(Vecrev(digits(p, n)), n)), p = nextprime(p+1)); p; \\ Michel Marcus, Mar 28 2021
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Robert G. Wilson v, Sep 09 2002
STATUS
approved