A088936 a(1)=1, a(2)=2 then a(A(k))=a(k) where a(1),a(2),...,a(k) are k consecutive defined terms and A(k)=a(1)+a(2)+...+a(k). Fill in any undefined places with max{a(i)+1 : 1<=i<=k}.

1, 2, 2, 3, 2, 4, 4, 3, 4, 2, 5, 5, 5, 4, 5, 5, 5, 4, 5, 5, 3, 5, 5, 5, 4, 5, 2, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 3, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 4, 6, 6, 6, 6, 5, 6, 2, 7

Offset

1,2

Links

Table of n, a(n) for n=1..105.

Formula

a(A088938(n)) = 2.

Crossrefs

Cf. A088937 (partial sums), A088938 (occurrences of 2's), A088939, A088940.

Sequence in context: A371745 A209700 A115980 * A328405 A049822 A140060

Adjacent sequences: A088933 A088934 A088935 * A088937 A088938 A088939

Keyword

nonn

Author

Benoit Cloitre and Claude Lenormand (claude.lenormand(AT)free.fr), Oct 25 2003

Status

approved