login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082446 a(0)=0, a(1)=1, a(2)=0; thereafter, if k>=0 and a block of the first 3*2^k terms is known, then a(3*2^k+i)=1-a(i) for 0<=i<3*2^k. 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

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, Nov 10 2003

LINKS

Table of n, a(n) for n=0..90.

FORMULA

a(n) = (hammingweight(n\3) + (n%3)) % 2. - Kevin Ryde, Sep 09 2017

CROSSREFS

Sequence in context: A147781 A327216 A288640 * A191156 A144611 A288473

Adjacent sequences:  A082443 A082444 A082445 * A082447 A082448 A082449

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 25 2003

EXTENSIONS

Entries and description corrected by Kevin Ryde, Sep 09 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 12:09 EST 2022. Contains 358359 sequences. (Running on oeis4.)