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 A261434 #15 Jul 20 2025 21:39:09
%S A261434 3,83,383,883,3083,3803,3833,8803,30803,33083,38083,38303,38333,38803,
%T A261434 38833,80803,80833,83003,83383,83833,88003,88883,303803,308003,308303,
%U A261434 308333,308383,330383,333383,333803,338033,338383,338803,380333,380383,380803,383083
%N A261434 Primes having only {0, 3, 8} as digits.
%C A261434 A020464 is a subsequence.
%H A261434 Alois P. Heinz, <a href="/A261434/b261434.txt">Table of n, a(n) for n = 1..10000</a>
%H A261434 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%t A261434 Select[Prime[Range[2 10^5]], Complement[IntegerDigits[#], {0, 3, 8}] == {} &]
%t A261434 Select[FromDigits/@Tuples[{0,3,8},6],PrimeQ] (* _Harvey P. Dale_, Jul 10 2017 *)
%o A261434 (Magma) [p: p in PrimesUpTo(2*10^6) | Set(Intseq(p)) subset [0, 3, 8]];
%Y A261434 Cf. Primes that contain only the digits (0,3,k): A260044 (k=1), A260125 (k=2), A199340 (k=4), A260223 (k=5), A260378 (k=7), this sequence (k=8).
%Y A261434 Cf. A000040, A020464.
%K A261434 nonn,easy,base
%O A261434 1,1
%A A261434 _Vincenzo Librandi_, Aug 18 2015