login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the number of distinct substrings in the initial string of length n of the repetition-resistant sequence A079101.
3

%I #3 Mar 30 2012 18:57:05

%S 1,3,5,8,11,15,21,27,34,41,49,58,69,80,92,105,119,133,148,164,181,200,

%T 219,239,260,282,305,329,355,381,408,436,465,495,526,557,589,622,656,

%U 691,727,764,802,841,881,922,964,1007,1051,1096,1142,1189,1237,1287

%N a(n) is the number of distinct substrings in the initial string of length n of the repetition-resistant sequence A079101.

%C Jointly submitted by C. Kimberling and Alejandro Dau, ad1n(AT)dc.uba.ar.

%e a(4) counts the following 8 strings in the initial segment, 0100, of A079101: 0, 1, 00, 01, 10, 010, 100, 0100.

%Y Cf. A079101, A038219.

%K nonn

%O 1,2

%A _Clark Kimberling_, Feb 17 2003