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 A257667 #33 Oct 30 2023 09:51:50 %S A257667 5,53,59,151,157,251,257,353,359,457,503,509,521,523,541,547,557,563, %T A257667 569,571,577,587,593,599,653,659,751,757,853,857,859,953,1051,1151, %U A257667 1153,1259,1451,1453,1459,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579 %N A257667 Primes containing a digit 5. %C A257667 Subsequence of primes of A011535. - _Michel Marcus_, May 03 2015 %C A257667 Primes in A062671. - _Bruno Berselli_, May 03 2015 %H A257667 Shujing Lyu, <a href="/A257667/b257667.txt">Table of n, a(n) for n = 1..100000</a> %F A257667 a(n) ~ n log n. - _Charles R Greathouse IV_, Nov 01 2022 %t A257667 Select[Prime[Range[250]], ! StringFreeQ[ToString[#], "5"] &] %o A257667 (Magma) [p: p in PrimesUpTo(1600) | 5 in Intseq(p)]; %o A257667 (Sage) [p for p in primes(1600) if 5 in p.digits(base=10)] # _Bruno Berselli_, May 03 2015 %o A257667 (PARI) forprime(p=1, 1600, if(vecsearch(vecsort(digits(p)), 5), print1(p, ", "))) \\ _Derek Orr_, May 05 2015; corrected by _Michel Marcus_, Oct 30 2023 %Y A257667 Cf. prime numbers containing the string k: A208270 (k=1), A208272 (k=2), A212525 (k=3), this sequence (k=5), A257668 (k=7), A166571 (k=10), A166572 (k=11), A243529 (k=12), A166573 (k=13), A243530 (k=14), A243531 (k=15), A243532 (k=16), A166579 (k=17), A243527 (k=111), A166580 (k=222), A166581 (k=333), A166582 (k=444). %Y A257667 Cf. A011535, A062671, A243531 (subsequence). %K A257667 nonn,base,easy %O A257667 1,1 %A A257667 _Vincenzo Librandi_, May 03 2015