%I #15 Feb 12 2017 17:19:39
%S 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 34,35,36,37,38,39,41,42,43,45,47,50,51,52,53,54,55,56,57,58,59,61,62,
%U 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 At least one prime occurs as a substring of the digits of n.
%C A039997(a(n)) > 0. - _Reinhard Zumkeller_, Jan 31 2012
%C 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 Reinhard Zumkeller, <a href="/A163753/b163753.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%e a(6) = 12 because "2" is a prime substring of "12".
%o (Haskell)
%o a163753 n = a163753_list !! (n-1)
%o a163753_list = filter ((> 0) . a039997) [0..]
%o -- _Reinhard Zumkeller_, Jan 31 2012
%Y Cf. A062115 (complement), A205667 (subsequence), A071062.
%K base,easy,nonn
%O 1,1
%A _Gil Broussard_, Aug 03 2009