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 A158051 #15 Apr 03 2023 10:36:11
%S A158051 11,101,113,131,139,151,181,191,193,211,239,241,293,311,349,359,379,
%T A158051 389,397,421,439,593,739,811,839,911,937,953,983,1009,1013,1019,1021,
%U A158051 1031,1039,1051,1061,1091,1093,1103,1109,1117,1123,1129,1151,1153,1163,1171
%N A158051 Primes in which a digit is square of another digit in the same prime.
%C A158051 There are << x^k primes missing from this sequence up to x, where k = log 6/log 10 = 0.7781.... - _Charles R Greathouse IV_, Nov 29 2022
%H A158051 Chris Caldwell, <a href="https://t5k.org/lists/small/1000.txt">The First 1,000 Primes</a>
%F A158051 a(n) ~ n log n. - _Charles R Greathouse IV_, Nov 29 2022
%e A158051 953 is a prime in which a digit is square of another digit.
%t A158051 Select[Prime[Range[200]],AnyTrue[Sort/@Subsets[IntegerDigits[#],{2}],#[[1]]^2 == #[[2]]&]&] (* _Harvey P. Dale_, Nov 29 2022 *)
%o A158051 (Python)
%o A158051 from sympy import isprime
%o A158051 def ok(n): s = str(n); return (s.count("0") > 1 or s.count("1") > 1 or ("2" in s and "4" in s) or ("3" in s and "9" in s)) and isprime(n)
%o A158051 print([k for k in range(1172) if ok(k)]) # _Michael S. Branicky_, Nov 29 2022
%Y A158051 Subsequence of A158290.
%K A158051 base,nonn
%O A158051 1,1
%A A158051 _Parthasarathy Nambi_, Mar 11 2009
%E A158051 Corrected and extended by _Harvey P. Dale_, Nov 29 2022