OFFSET
1,1
COMMENTS
The sequence is finite. Proof: Each 9-digit number has at least 15 nonprime substrings. Thus, each number with more than 9 digits has >= 15 nonprime substrings, too. Consequently, there is a boundary b<10^9, such that all numbers > b have more than 12 nonprime substrings.
LINKS
Hieronymus Fischer, Table of n, a(n) for n = 1..51477
EXAMPLE
a(1)=10023, since 10023 has 12 nonprime substrings (0, 0, 1, 00, 02, 10, 002, 023, 100, 0023, 1002, 10023).
a(51477)=99733313, since there are 11 nonprime substrings (1, 9, 9, 33, 33, 99, 333, 973, 33313, 97333, 733313, 99733313).
CROSSREFS
KEYWORD
nonn,fini,base
AUTHOR
Hieronymus Fischer, Aug 26 2012
STATUS
approved
