OFFSET
1,1
COMMENTS
A rough heuristic argument suggests that there are infinite pairs (n, prime(n)) in which both n and prime(n) are reflectable, like in prime(1101088113338) = 33138318000311. See Links for a table of the first 250 such pairs. - Giovanni Resta, Mar 10 2013
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..10000
Prime Glossary, Reflectable prime
Giovanni Resta, The first 250 reflectable primes whose indices are reflectable.
MATHEMATICA
Select[FromDigits /@ Tuples[{0, 1, 3, 8}, 5], PrimeQ[#] &] (* Arkadiusz Wesolowski, Mar 06 2013 *)
PROG
(Haskell)
import Data.List (intersect)
a125308 n = a125308_list !! (n-1)
a125308_list = 3 : h [1, 3] where
h (u:us) | null (show v `intersect` "245679") &&
a010051' v == 1 = v : h (us ++ [v])
| otherwise = h (us ++ [v])
where v = u + 10
-- Reinhard Zumkeller, Jul 16 2014
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
G. L. Honaker, Jr., Dec 10 2006
EXTENSIONS
More terms from Arkadiusz Wesolowski, Mar 06 2013
STATUS
approved