|
|
A213313
|
|
Numbers with exactly 6 nonprime substrings (substrings with leading zeros are considered to be nonprime).
|
|
1
|
|
|
100, 104, 106, 108, 140, 144, 146, 148, 160, 164, 166, 168, 169, 180, 184, 186, 188, 400, 404, 406, 408, 440, 444, 446, 448, 460, 464, 466, 468, 469, 480, 481, 484, 486, 488, 490, 494, 496, 498, 600, 604, 606, 608, 609
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is finite. Proof: Each 8-digit number has at least 10 nonprime substrings. Thus, each number with more than 8 digits has >= 10 nonprime substrings, too. Consequently, there is a boundary b<10^7, such that all numbers > b have more than 6 nonprime substrings.
The first term is a(1)=100=A213302(6). The last term is a(2351)=3733797=A213300(6).
|
|
LINKS
|
|
|
EXAMPLE
|
a(1)=100, since 100 has 6 nonprime substrings (0, 0, 00, 1, 10, 100).
a(2351)= 3733797, since there are 6 nonprime substrings (9, 33, 3379, 7337, 733797, 3733797).
|
|
MATHEMATICA
|
Select[Range[700], Count[FromDigits/@Flatten[Table[Partition[ IntegerDigits[ #], n, 1], {n, IntegerLength[#]}], 1], _?(!PrimeQ[#]&)]==6&] (* Harvey P. Dale, Apr 08 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|