|
Search: id:A083921
|
|
|
| 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. |
|
+0
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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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 this_sequence A105496 A119672 A087740
Adjacent sequences: A083918 A083919 A083920 this_sequence A083922 A083923 A083924
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 09 2003
|
|
|
Search completed in 0.002 seconds
|
