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 A199348 #16 Jul 14 2025 17:28:51
%S A199348 3,43,83,383,433,443,883,3343,3433,3833,4483,8443,33343,34483,34843,
%T A199348 34883,38333,38833,44383,44483,44843,48383,48883,83383,83443,83833,
%U A199348 83843,84443,88843,88883,333383,333433,334333,334843,338383,343333,343433,344483,344843,348433,348443,348833,348883,383483,383833,384343,384383,388483
%N A199348 Primes having only {3, 4, 8} as digits.
%C A199348 All terms end in 3 and those > 3 never have the same number of 4's and 8's.
%H A199348 Jason Bard, <a href="/A199348/b199348.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harvey P. Dale)
%t A199348 Table[Select[FromDigits/@Tuples[{3,4,8},n],PrimeQ],{n,6}]//Flatten (* _Harvey P. Dale_, Apr 09 2022 *)
%o A199348 (PARI) a(n, list=0, L=[3, 4, 8], reqpal=0)={my(t); for(d=1, 1e9, u=vector(d, i, 10^(d-i))~; forvec(v=vector(d, i, [1+(i==1&!L[1]), #L]), isprime(t=vector(d, i, L[v[i]])*u) || next; reqpal & !isprime(A004086(t)) & next; list & print1(t", "); n--||return(t)))}
%Y A199348 Cf. A020449 - A020472, A199325 - A199329, A385768 - A385800.
%K A199348 nonn,base
%O A199348 1,1
%A A199348 _M. F. Hasler_, Nov 05 2011