cp's OEIS Frontend

A213303 Smallest number with n nonprime substrings (Version 2: substrings with leading zeros are counted as nonprime if the corresponding number is > 0).

%I A213303 #13 Jul 16 2015 22:15:18
%S A213303 2,1,10,14,101,104,144,1001,1014,1044,1444,10010,10014,10144,10444,
%T A213303 14444,100101,100104,100144,101444,104444,144444,1000144,1001014,
%U A213303 1001044,1001444,1014444,1044444,1444444,10001044,10001444,10010144,10010444,10014444,10144444,10444444,14444444,100010144
%N A213303 Smallest number with n nonprime substrings (Version 2: substrings with leading zeros are counted as nonprime if the corresponding number is > 0).
%C A213303 The sequence is well defined since for each n >= 0 there is a number with n nonprime substrings.
%C A213303 Different from A213304, first different term is a(16).
%H A213303 Hieronymus Fischer, <a href="/A213303/b213303.txt">Table of n, a(n) for n = 0..100</a>
%F A213303 a(m(m+1)/2) = (13*10^(m-1)-4)/9, m>0.
%F A213303 With b(n):=floor((sqrt(8*n-7)-1)/2):
%F A213303 a(n) > 10^b(n), for n>2, a(n) = 10^b(n) for n=1,2.
%F A213303 a(n) >= 10^b(n)+4*10^(n-1-b(n)(b(n)+1)/2)-1)/9, equality holds if n or n+1 is a triangular number > 0 (cf. A000217).
%F A213303 a(n) <= A213304(n).
%F A213303 a(n) <= A213306(n).
%e A213303 a(0)=2, since 2 is the least number with zero nonprime substrings.
%e A213303 a(1)=1, since 1 has 1 nonprime substrings.
%e A213303 a(2)=10, since 10 is the least number with 2 nonprime substrings, these are 1 and 10 ('0' will not be counted).
%e A213303 a(3)=14, since 14 is the least number with 3 nonprime substrings, these are 1 and 4 and 14. 10, 11 and 12 only have 2 such substrings.
%Y A213303 Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
%Y A213303 Cf. A035244, A079307, A213300 - A213321.
%K A213303 nonn,base
%O A213303 0,1
%A A213303 _Hieronymus Fischer_, Aug 26 2012