A163753 At least one prime occurs as a substring of the digits of n.

2, 3, 5, 7, 11, 12, 13, 15, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 45, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 65, 67, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 82, 83, 85, 87, 89, 92, 93, 95, 97, 101, 102

Offset: 1

Author

Gil Broussard, Aug 03 2009

Keywords

• base
• easy
• nonn

Comments

A039997(a(n)) > 0. - Reinhard Zumkeller, Jan 31 2012

This sequence (written in decimal) is automatic in the terminology of Allouche & Shallit since A071062 is finite. - Charles R Greathouse IV, Jan 31 2012

Examples

			a(6) = 12 because "2" is a prime substring of "12".
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Index entries for 10-automatic sequences.

Crossrefs

Cf. A062115 (complement), A205667 (subsequence), A071062.

Programs

Haskell

a163753 n = a163753_list !! (n-1)
a163753_list = filter ((> 0) . a039997) [0..]
-- Reinhard Zumkeller, Jan 31 2012