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 A260226 #11 Jul 21 2025 00:46:33
%S A260226 3,5,53,83,353,383,853,883,3533,3583,3833,3853,5333,8353,33353,33533,
%T A260226 35353,35533,38333,38833,53353,55333,83383,83833,85333,85853,88853,
%U A260226 88883,333383,333533,335383,335833,338383,353333,353833,355853,383533,383833,533353
%N A260226 Primes having only {3, 5, 8} as digits.
%C A260226 A020462 and A020464 are subsequences.
%H A260226 Alois P. Heinz, <a href="/A260226/b260226.txt">Table of n, a(n) for n = 1..10000</a>
%H A260226 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%t A260226 Select[Prime[Range[5 10^4]], Complement[IntegerDigits[#], {3, 5, 8}]=={} &]
%t A260226 Select[Flatten[Table[FromDigits/@Tuples[{3,5,8},n],{n,6}]],PrimeQ] (* or *) Join[{3,5},Select[10#+3&/@Flatten[Table[FromDigits/@Tuples[{3,5,8},n],{n,5}]],PrimeQ]] (* The second program is faster because it recognizes that, except only for 5, each such prime must end in 3. *) (* _Harvey P. Dale_, Jul 17 2020 *)
%o A260226 (Magma) [p: p in PrimesUpTo(2*10^6) | Set(Intseq(p)) subset [3, 5, 8]];
%Y A260226 Cf. similar sequences listed in A260223.
%Y A260226 Cf. A020462, A020464.
%K A260226 nonn,easy,base
%O A260226 1,1
%A A260226 _Vincenzo Librandi_, Jul 22 2015