A083921 Start with (1,2) and then concatenate 2^n+1 previous terms, n>=0 and add 2 if a(2^n+1)=1 or add 1 if a(2^n+1)=2.

1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1

Offset

1,2

Links

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

Example

The first 2^2+1 = 5 terms are 1,2,1,2,1. Concatenate those 5 terms gives 1,2,1,2,1,1,2,1,2,1; the last term a(5) is 1 hence we add 2 and 2^3+1 first terms are 1,2,1,2,1,1,2,1,2,1,2

Crossrefs

Cf. A083922 (partial sums).

Sequence in context: A006338 A020903 A133083 * A119672 A271608 A087740

Adjacent sequences: A083918 A083919 A083920 * A083922 A083923 A083924

Keyword

nonn

Author

Benoit Cloitre, May 09 2003

Status

approved