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 A155547 #11 Jan 28 2024 16:44:29
%S A155547 2,7,13,19,23,29,31,43,53,61,67,173,179,193,199,223,227,281,283,311,
%T A155547 317,337,347,409,419,433,443,457,461,463,467,491,503,521,523,541,547,
%U A155547 569,577,593,599,601,607,619,641,647,653,809,811,827,839,857,859,941,947
%N A155547 a(n) = prime(n) without prime digits in n.
%C A155547 Prime digit = 2, 3, 5 or 7.
%H A155547 Harvey P. Dale, <a href="/A155547/b155547.txt">Table of n, a(n) for n = 1..1000</a>
%F A155547 a(n) = A000040(A084984(n)). - _R. J. Mathar_, Jan 25 2009
%p A155547 isA084984 := proc(n) local dgs ; dgs := convert(convert(n,base,10),set) ; if dgs intersect {2,3,5,7} <> {} then false; else true; fi; end: A084984 := proc(n) option remember ; local a ; if n = 1 then 1; else for a from procname(n-1)+1 do if isA084984(a) then RETURN(a) ; fi; od; fi; end: A155547 := proc(n) ithprime(A084984(n)) ; end: for n from 1 to 80 do printf("%d,",A155547(n)) ; od: # _R. J. Mathar_, Jan 25 2009
%t A155547 Prime[#]&/@Select[Range[200],NoneTrue[IntegerDigits[#],PrimeQ]&] (* _Harvey P. Dale_, Jan 28 2024 *)
%Y A155547 Cf. A000027, A000040.
%K A155547 nonn,base
%O A155547 1,1
%A A155547 _Juri-Stepan Gerasimov_, Jan 24 2009