cp's OEIS Frontend

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.

A386338 Primes without {2, 8} as digits.

This page as a plain text file.
%I A386338 #8 Jul 19 2025 21:40:06
%S A386338 3,5,7,11,13,17,19,31,37,41,43,47,53,59,61,67,71,73,79,97,101,103,107,
%T A386338 109,113,131,137,139,149,151,157,163,167,173,179,191,193,197,199,307,
%U A386338 311,313,317,331,337,347,349,353,359,367,373,379,397,401,409,419,431
%N A386338 Primes without {2, 8} as digits.
%H A386338 Jason Bard, <a href="/A386338/b386338.txt">Table of n, a(n) for n = 1..10000</a>
%H A386338 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%p A386338 f:= n-> (l-> add([0, 1, $3..7, 9][l[j]+1]*10^(j-1), j=1..nops(l)))(convert(n, base, 8)):
%p A386338 select(isprime, [seq(f(i), i=0..600)])[];  # _Alois P. Heinz_, Jul 19 2025
%t A386338 Select[Prime[Range[120]], DigitCount[#, 10, 2] == 0 && DigitCount[#, 10, 8] == 0 &]
%o A386338 (Magma) [p: p in PrimesUpTo(10^6) | Set(Intseq(p)) subset [0, 1, 3, 4, 5, 6, 7, 9]];
%o A386338 (Python) print(list(islice(primes_with("01345679"), 41))) # uses function/imports in A385776
%o A386338 (PARI) primes_with(, 1, [0, 1, 3, 4, 5, 6, 7, 9]) \\ uses function in A385776
%Y A386338 Intersection of A038604 and A038616.
%Y A386338 Cf. A000040, A329760, A385776.
%K A386338 nonn,base,easy
%O A386338 1,1
%A A386338 _Jason Bard_, Jul 19 2025