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 A329760 #20 Jul 23 2025 18:32:07
%S A329760 3,5,11,13,19,31,41,43,53,59,61,83,89,101,103,109,113,131,139,149,151,
%T A329760 163,181,191,193,199,311,313,331,349,353,359,383,389,401,409,419,431,
%U A329760 433,439,443,449,461,463,491,499,503,509,541,563,569,593,599,601,613
%N A329760 Primes without {2, 7} as digits.
%H A329760 Alois P. Heinz, <a href="/A329760/b329760.txt">Table of n, a(n) for n = 1..20000</a>
%H A329760 Marianne Freiberger, <a href="https://plus.maths.org/content/missing-7s">Primes without 7s</a>.
%H A329760 James Maynard, <a href="http://arxiv.org/abs/1604.01041">Primes with restricted digits</a>, arXiv:1604.01041 [math.NT], 2016.
%H A329760 James Maynard and Brady Haran, <a href="https://www.youtube.com/watch?v=eeoBCS7IEqs">Primes without a 7</a>, Numberphile video (2019)
%H A329760 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%F A329760 { A038604 } intersect { A038615 }.
%t A329760 Select[Prime[Range[120]], DigitCount[#, 10, 2]==0 && DigitCount[#, 10, 7]==0 &] (* _Vincenzo Librandi_, Jan 02 2020 *)
%o A329760 (Magma) [p: p in PrimesUpTo(700) | not 2 in Intseq(p) and not 7 in Intseq(p) ]; // _Vincenzo Librandi_, Jan 02 2020
%Y A329760 Cf. A000040, A020459, A038604, A038615.
%K A329760 nonn,base
%O A329760 1,1
%A A329760 _Alois P. Heinz_, Nov 20 2019