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 A253578 #12 Jan 15 2015 19:16:54
%S A253578 3,877
%N A253578 Primes p such that digits of p do not appear in p^10.
%C A253578 a(3) > 10^7.
%C A253578 Numbers n < 10^7 such that digits of n are not present in n^10: 3, 9, 18, 877, 5757.
%C A253578 a(3) > 10^10. - _Chai Wah Wu_, Jan 15 2015
%e A253578 3 and 3^10 = 59049 have no digits in common, hence 3 is in the sequence.
%t A253578 Select[Prime[Range[1000000]], Intersection[IntegerDigits[#], IntegerDigits[#^10]]=={} &]
%o A253578 (Python)
%o A253578 from sympy import isprime
%o A253578 A253578_list = [n for n in range(1,10**6) if set(str(n)) & set(str(n**10)) == set() and isprime(n)] # _Chai Wah Wu_, Jan 15 2015
%Y A253578 Cf. similar sequences listed in A253574.
%K A253578 nonn,base,bref,more
%O A253578 1,1
%A A253578 _Vincenzo Librandi_, Jan 05 2015