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 A154761 #16 Jul 23 2025 18:29:59
%S A154761 2,3,5,7,23,37,43,47,53,67,73,83,223,227,233,257,263,277,283,307,337,
%T A154761 347,353,367,373,383,433,443,457,463,467,487,503,523,547,557,563,577,
%U A154761 587,607,643,647,653,673,677,683,727,733,743,757,773,787,823,827,853
%N A154761 Primes without {1, 9} as digits.
%H A154761 Jason Bard, <a href="/A154761/b154761.txt">Table of n, a(n) for n = 1..10000</a>
%H A154761 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%p A154761 no19 := proc(n) local d ; for d in convert(n,base,10) do if d in {1,9} then RETURN(false) ; fi; od: RETURN(true) ; end: for n from 1 to 400 do p := ithprime(n) ; if no19(p) then printf("%d,",p) ; fi; od: # _R. J. Mathar_, Jan 18 2009
%t A154761 Select[Prime[Range[120]], DigitCount[#, 10, 1] == 0 && DigitCount[#, 10, 9] == 0 &] (* _Jason Bard_, Jul 20 2025 *)
%o A154761 (Python) print(list(islice(primes_with("02345678"), 41))) # uses function/imports in A385776
%Y A154761 Cf. A000040, A385776, A386320 - A386358.
%K A154761 nonn,base
%O A154761 1,1
%A A154761 _Juri-Stepan Gerasimov_, Jan 15 2009
%E A154761 443 inserted by _R. J. Mathar_, Jan 18 2009