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 A048393 #25 May 01 2021 08:03:02
%S A048393 11,13,23,31,41,43,53,61,73,101,107,109,121,137,143,149,151,157,161,
%T A048393 169,173,181,191,211,217,221,229,233,241,253,257,259,271,277,281,299,
%U A048393 307,311,313,319,323,331,421,427,431,449,469,493,511,527,541,577,589
%N A048393 Replacing digits d in decimal expansion of n with d^3 yields a prime.
%e A048393 313 = (3)(1)(3) -> (27)(1)(27) = 27127, which is a prime.
%t A048393 Select[Range[600],PrimeQ[FromDigits[Flatten[IntegerDigits/@ (IntegerDigits[ #]^3)]]]&] (* _Harvey P. Dale_, Jan 27 2015 *)
%o A048393 (Python)
%o A048393 from sympy import primerange, isprime
%o A048393 for n in primerange(2,600):
%o A048393 t=int(''.join(str(int(i)**3) for i in str(n)))
%o A048393 if sympy.isprime(t):
%o A048393 print(n)
%o A048393 # _Abhiram R Devesh_, Feb 09 2015
%Y A048393 Cf. A048390, A048394.
%K A048393 nonn,base
%O A048393 1,1
%A A048393 _Patrick De Geest_, Mar 15 1999
%E A048393 Offset corrected by _Michel Marcus_, Oct 19 2016