OFFSET
1,1
COMMENTS
Is this the same as A114924, or are there base-10 expressions of pi(p) which become p after striking 2 or more digits? - R. J. Mathar, Apr 18 2023
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..54 (n=1..50 from Jean-Marc Rebert)
PROG
(Python)
from sympy import sieve
def okA362060(n):
p = sieve[n]
while n and p:
if n%10 == p%10:
n //= 10
p //= 10
return n == 0
print([sieve[k] for k in range(1, 10**6) if okA362060(k)]) # Michael S. Branicky, Apr 07 2023
(Python)
from sympy import prime, nextprime
from itertools import count, islice
def A362066_gen(startvalue=1): # generator of terms >= startvalue
p = prime(max(startvalue, 1))
for k in count(max(startvalue, 1)):
c = iter(str(p))
if all(map(lambda b:any(map(lambda a:a==b, c)), str(k))):
yield p
p = nextprime(p)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jean-Marc Rebert, Apr 07 2023
STATUS
approved