|
Search: id:A082446
|
|
|
| A082446 |
|
a(1)=0, a(2)=1, a(2)=0, then if k>=0 and 3*2^k first terms are known, a(3*2^k+i)=1-a(i) for 1<=i<=3*2^k. |
|
+0
1
|
|
| 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Take the Thue-Morse sequence 0,1,1,0,1,0,0,1,... and insert (1,0) after each 0 and (0,1) after each 1. This gives : 0,(1,0),1,(0,1),1,(0,1),0,(1,0),1,(0,1),0,(1,0),... and sequence begins 0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,... - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 10 2003
|
|
CROSSREFS
|
Sequence in context: A073445 A113217 A147781 this_sequence A144611 A130853 A115516
Adjacent sequences: A082443 A082444 A082445 this_sequence A082447 A082448 A082449
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 25 2003
|
|
|
Search completed in 0.002 seconds
|
