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 A020462 #24 Jul 01 2025 08:29:01
%S A020462 3,5,53,353,3533,5333,33353,33533,35353,35533,53353,55333,333533,
%T A020462 353333,533353,535333,3335533,3353333,3353533,3355553,3533533,3553553,
%U A020462 3555353,5333353,5333533,5353553,5533553,33335333,33555553,35535553,35553533,53355353,53533553
%N A020462 Primes that contain digits 3 and 5 only.
%H A020462 Jason Bard, <a href="/A020462/b020462.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi)
%p A020462 sort(convert(`union`(seq(select(isprime,map(t -> 3*(10^d-1)/9 + 2*add(10^(s-1),s=t),combinat:-powerset(d))),d=0..10)),list)); # _Robert Israel_, Jul 21 2015
%t A020462 Flatten[Table[Select[FromDigits/@Tuples[{3,5},n],PrimeQ],{n,8}]] (* _Vincenzo Librandi_, Jul 27 2012 *)
%o A020462 (Python)
%o A020462 from gmpy2 import is_prime, mpz
%o A020462 from itertools import product
%o A020462 A020462_list = [int(''.join(x)) for n in range(1,10) for x in product('35',repeat=n) if is_prime(mpz(''.join(x)))] # _Chai Wah Wu_, Jul 21 2015
%Y A020462 Subsequence of A030096.
%K A020462 nonn,base
%O A020462 1,1
%A A020462 _David W. Wilson_