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 A152313 #16 Sep 08 2022 08:45:39 %S A152313 11,19,41,61,89,149,181,191,199,419,449,461,491,499,619,641,661,691, %T A152313 811,881,911,919,941,991,1181,1481,1489,1499,1619,1669,1699,1811,1861, %U A152313 1889,1949,1999,4111,4441,4481,4649,4691,4861,4889,4919,4969,4999 %N A152313 Primes without 0's or primes in their decimal expansion. %H A152313 Robert Israel, <a href="/A152313/b152313.txt">Table of n, a(n) for n = 1..10000</a> %p A152313 F:= proc(d) local T, R, L, r; %p A152313 R:= NULL; %p A152313 T:= combinat:-cartprod([[1,4,6,8,9]$d]); %p A152313 while not T[finished] do %p A152313 L:= T[nextvalue](); %p A152313 r:= add(L[i]*10^(d-i),i=1..d); %p A152313 if isprime(r) then R:= R,r fi %p A152313 od; %p A152313 R %p A152313 end proc: %p A152313 seq(F(d),d=2..5); # _Robert Israel_, Dec 07 2017 %t A152313 Select[Prime[Range[800]], Complement[IntegerDigits[#], {1, 4, 6, 8, 9}] == {} &] (* _Vincenzo Librandi_, Oct 25 2016 *) %o A152313 (Magma) [p: p in PrimesUpTo(5000) | Set(Intseq(p)) subset [1,4,6,8,9]]; // _Vincenzo Librandi_, Oct 25 2016 %Y A152313 Cf. A019546, A034844, A087363, A152312. %K A152313 base,easy,nonn %O A152313 1,1 %A A152313 _Omar E. Pol_, Dec 02 2008