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.

A386337 Primes without {2, 6} as digits.

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