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 A214705 #23 Jul 14 2025 16:41:58 %S A214705 2,5,7,227,257,277,557,577,727,757,2557,2777,5227,5527,5557,7577,7727, %T A214705 7757,22277,22727,22777,25577,27277,27527,52727,52757,57527,57557, %U A214705 57727,72227,72277,72577,72727,75227,75277,75527,75557,75577,77527,77557,222527,222557 %N A214705 Primes that contain only the digits (2, 5, 7). %C A214705 The digits are prime numbers. %H A214705 Jason Bard, <a href="/A214705/b214705.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi) %t A214705 Flatten[Table[Select[FromDigits/@Tuples[{2,5,7},n],PrimeQ],{n,6}]] %o A214705 (Magma) [p: p in PrimesUpTo(100000) | Set(Intseq(p)) subset [2,5,7]]; %o A214705 (Python) %o A214705 from sympy import primerange %o A214705 def ok(p): return set(str(p)) <= set("257") %o A214705 def aupto(limit): return [p for p in primerange(2, limit+1) if ok(p)] %o A214705 print(aupto(222557)) # _Michael S. Branicky_, Feb 05 2021 %Y A214705 Subsequence of A019546. %Y A214705 Cf. A385768 - A385800. %K A214705 nonn,base,easy %O A214705 1,1 %A A214705 _Vincenzo Librandi_, Jul 28 2012