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 A163753 #15 Feb 12 2017 17:19:39 %S A163753 2,3,5,7,11,12,13,15,17,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33, %T A163753 34,35,36,37,38,39,41,42,43,45,47,50,51,52,53,54,55,56,57,58,59,61,62, %U A163753 63,65,67,70,71,72,73,74,75,76,77,78,79,82,83,85,87,89,92,93,95,97,101,102 %N A163753 At least one prime occurs as a substring of the digits of n. %C A163753 A039997(a(n)) > 0. - _Reinhard Zumkeller_, Jan 31 2012 %C A163753 This sequence (written in decimal) is automatic in the terminology of Allouche & Shallit since A071062 is finite. - _Charles R Greathouse IV_, Jan 31 2012 %H A163753 Reinhard Zumkeller, <a href="/A163753/b163753.txt">Table of n, a(n) for n = 1..10000</a> %H A163753 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>. %e A163753 a(6) = 12 because "2" is a prime substring of "12". %o A163753 (Haskell) %o A163753 a163753 n = a163753_list !! (n-1) %o A163753 a163753_list = filter ((> 0) . a039997) [0..] %o A163753 -- _Reinhard Zumkeller_, Jan 31 2012 %Y A163753 Cf. A062115 (complement), A205667 (subsequence), A071062. %K A163753 base,easy,nonn %O A163753 1,1 %A A163753 _Gil Broussard_, Aug 03 2009