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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135133 a(n) = floor(S2(n)/3) mod 2, where S2(n) denotes the binary weight of n. 2
 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS A generalized Thue-Morse sequence. LINKS Nathaniel Johnston, Table of n, a(n) for n = 0..10000 Ricardo Astudillo, On a class of Thue-Morse type sequences, Journal of Integer Sequences, Vol. 6 (2003), Article 03.4.2. MAPLE S2 := proc(n) return add(d, d=convert(n, base, 2)): end: A135133 := proc(n) return floor(S2(n)/3) mod 2: end: seq(A135133(n), n=0..104); # Nathaniel Johnston, May 06 2011 MATHEMATICA Table[Mod[Floor[(Plus @@ IntegerDigits[n, 2])/3], 2], {n, 0, 50}] (* G. C. Greubel, Sep 28 2016 *) CROSSREFS Cf. A000120, A010060. Sequence in context: A358753 A175854 A353678 * A011712 A011715 A011721 Adjacent sequences: A135130 A135131 A135132 * A135134 A135135 A135136 KEYWORD nonn,base,easy AUTHOR Ctibor O. Zizka, Feb 12 2008 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.

Last modified January 28 17:08 EST 2023. Contains 359895 sequences. (Running on oeis4.)