cp's OEIS Frontend

A380906 Primes without {3, 5} as digits.

%I A380906 #29 Jul 23 2025 18:32:41
%S A380906 2,7,11,17,19,29,41,47,61,67,71,79,89,97,101,107,109,127,149,167,179,
%T A380906 181,191,197,199,211,227,229,241,269,271,277,281,401,409,419,421,449,
%U A380906 461,467,479,487,491,499,601,607,617,619,641,647,661,677,691,701,709,719,727,761,769,787,797
%N A380906 Primes without {3, 5} as digits.
%H A380906 Alois P. Heinz, <a href="/A380906/b380906.txt">Table of n, a(n) for n = 1..10000</a> (first 3275 terms from Vincenzo Librandi)
%H A380906 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%t A380906 Select[Prime[Range[120]],DigitCount[#,10,3]==0&&DigitCount[#,10,5]==0&]
%o A380906 (Magma) [p: p in PrimesUpTo(700) | not 3 in Intseq(p) and not 5 in Intseq(p) ];
%o A380906 (PARI) isok(p) = if (isprime(p), my(d=digits(p)); (#select(x->(x==3), d)==0) && (#select(x->(x==5), d)==0)); \\ _Michel Marcus_, Feb 10 2025
%o A380906 (Python)
%o A380906 from itertools import count, islice
%o A380906 from sympy import isprime
%o A380906 def A380906_gen(): # generator of terms
%o A380906     return filter(isprime,(int(oct(n)[2:].translate({51:52,52:54,53:55,54:56,55:57})) for n in count(1)))
%o A380906 A380906_list = list(islice(A380906_gen(),20)) # _Chai Wah Wu_, Feb 12 2025
%Y A380906 Intersection of A038611 and A038613.
%Y A380906 Cf. A000040, A020462, A329760.
%K A380906 base,nonn
%O A380906 1,1
%A A380906 _Vincenzo Librandi_, Feb 09 2025