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 A245576 #33 Jun 14 2024 13:08:43
%S A245576 2,3,5,7,11,13,17,19,23,29,31,37,41,43,59,61,67,73,79,83,89,113,127,
%T A245576 131,137,139,157,163,167,173,181,191,193,211,223,227,229,233,239,263,
%U A245576 269,271,277,281,293,311,313,337,359,367,373,379,383,389,419,421,431,433
%N A245576 Primes p such that p and p^2 lack the zero digit in their decimal expansions.
%C A245576 Subsequence of A052042. First terms that are in A052042 but not here: 107, 109, 307, 409.
%H A245576 Chai Wah Wu, <a href="/A245576/b245576.txt">Table of n, a(n) for n = 1..3001</a>
%t A245576 fQ[n_] := Min[IntegerDigits[n]] > 0; Select[Prime @ Range @ 90, fQ[#] && fQ[#^2] &]
%t A245576 Select[Prime[Range[100]],FreeQ[{IntegerDigits[#],IntegerDigits[#^2]},0]&] (* _Harvey P. Dale_, Jun 14 2024 *)
%o A245576 (PARI) (vmd (n) = vecmin (digits (n))); p = 2;for (k = 1, 300, if (vmd (p) > 0 && vmd (p^2) > 0, print1 (p ", " )); p = nextprime (1 + p))
%o A245576 (Python)
%o A245576 from sympy import prime
%o A245576 A245576_list = [p for p in (prime(i) for i in range(1,10**4)) if not(str(p).count('0') or str(p**2).count('0'))]
%o A245576 # _Chai Wah Wu_, Dec 27 2014
%Y A245576 Cf. A052042, A052043.
%K A245576 base,nonn
%O A245576 1,1
%A A245576 _Zak Seidov_, Dec 25 2014