This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A362066 #26 Apr 18 2023 10:24:38 %S A362066 17,12491,14723,42437,57089,58193,61051,63131,63347,64553,64567,64577, %T A362066 64591,64601,64661,64679,64951,65071,65173,65293,65881,66863,69931, %U A362066 79817,99551,129083,165103,263071,284833,1407647,1515259,4303027,6440999,14968819,95517973,527737957,1893230839,1950929941,1964567161 %N A362066 Primes associated with the indices in A362060. %C A362066 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 %H A362066 Chai Wah Wu, <a href="/A362066/b362066.txt">Table of n, a(n) for n = 1..54</a> (n=1..50 from Jean-Marc Rebert) %o A362066 (Python) %o A362066 from sympy import sieve %o A362066 def okA362060(n): %o A362066 p = sieve[n] %o A362066 while n and p: %o A362066 if n%10 == p%10: %o A362066 n //= 10 %o A362066 p //= 10 %o A362066 return n == 0 %o A362066 print([sieve[k] for k in range(1, 10**6) if okA362060(k)]) # _Michael S. Branicky_, Apr 07 2023 %o A362066 (Python) %o A362066 from sympy import prime, nextprime %o A362066 from itertools import count, islice %o A362066 def A362066_gen(startvalue=1): # generator of terms >= startvalue %o A362066 p = prime(max(startvalue,1)) %o A362066 for k in count(max(startvalue,1)): %o A362066 c = iter(str(p)) %o A362066 if all(map(lambda b:any(map(lambda a:a==b,c)),str(k))): %o A362066 yield p %o A362066 p = nextprime(p) %o A362066 A362066_list = list(islice(A362066_gen(),20)) # _Chai Wah Wu_, Apr 07 2023 %Y A362066 Cf. A362060. %K A362066 nonn,base %O A362066 1,1 %A A362066 _Jean-Marc Rebert_, Apr 07 2023