A213306 Minimal prime with n nonprime substrings (Version 2: substrings with leading zeros are counted as nonprime if the corresponding number is > 0).
2, 13, 11, 103, 101, 149, 1009, 1021, 1049, 1481, 10039, 10069, 10169, 11681, 14669, 100109, 100189, 100169, 101681, 104681, 146669, 1000669, 1001041, 1001081, 1004669, 1014469, 1046849, 1468469, 10001081, 10004669, 10010851
Offset: 0
Examples
a(0) = 2, since 2 is the least number with zero nonprime substrings. a(1) = 13, since 13 has 1 nonprime substring (=’1’). a(2) = 11, since 11 is the least number with 2 nonprime substrings (= 2 times ‘1’). a(3) = 103, since 103 is the least number with 3 nonprime substrings, these are ‘1’ and ‘10’ and ‘03’ (‘0’ is not a valid substring in version 2).
Links
- Hieronymus Fischer, Table of n, a(n) for n = 0..100