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 A386331 #10 Jul 19 2025 21:41:28
%S A386331 2,3,7,23,29,37,43,47,67,73,79,83,89,97,223,227,229,233,239,263,269,
%T A386331 277,283,293,307,337,347,349,367,373,379,383,389,397,409,433,439,443,
%U A386331 449,463,467,479,487,499,607,643,647,673,677,683,709,727,733,739,743,769
%N A386331 Primes without {1, 5} as digits.
%H A386331 Jason Bard, <a href="/A386331/b386331.txt">Table of n, a(n) for n = 1..10000</a>
%H A386331 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%p A386331 f:= n-> (l-> add([0, $2..4, $6..9][l[j]+1]*10^(j-1), j=1..nops(l)))(convert(n, base, 8)):
%p A386331 select(isprime, [seq(f(i), i=0..600)])[]; # _Alois P. Heinz_, Jul 19 2025
%t A386331 Select[Prime[Range[120]], DigitCount[#, 10, 1] == 0 && DigitCount[#, 10, 5] == 0 &]
%o A386331 (Magma) [p: p in PrimesUpTo(10^6) | Set(Intseq(p)) subset [0, 2, 3, 4, 6, 7, 8, 9]];
%o A386331 (Python) print(list(islice(primes_with("02346789"), 41))) # uses function/imports in A385776
%o A386331 (PARI) primes_with(, 1, [0, 2, 3, 4, 6, 7, 8, 9]) \\ uses function in A385776
%Y A386331 Intersection of A038603 and A038613.
%Y A386331 Cf. A000040, A020453, A385776.
%K A386331 nonn,base,easy
%O A386331 1,1
%A A386331 _Jason Bard_, Jul 19 2025