This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293162 Take every third term of the {0,1}-version of the Thue-Morse sequence: a(n) = A010060(3n). 6
 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0 REFERENCES Cobham, A., Uniform tag sequences, Math. Systems Theory (1972) 6: 164-192. https://doi.org/10.1007/BF01706087. See Example 9. Hofer, Roswitha. "Coquet-type formulas for the rarefied weighted Thue-Morse sequence." Discrete Mathematics 311.16 (2011): 1724-1734. LINKS Antti Karttunen, Table of n, a(n) for n = 0..21846 FORMULA From Antti Karttunen, Dec 01 2017: (Start) a(n) = A000035(A000120(3*n)). a(n) = A010060(n) + A295890(n) mod 2. (End) PROG (Scheme) (define (A293162 n) (A000035 (A000120 (* 3 n)))) ;; Antti Karttunen, Dec 01 2017 CROSSREFS Cf. A010060, A005599, A293163, A293164, A295890. Sequence in context: A277153 A187946 A188436 * A175854 A185708 A286996 Adjacent sequences:  A293159 A293160 A293161 * A293163 A293164 A293165 KEYWORD nonn AUTHOR N. J. A. Sloane, Oct 15 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 18 16:22 EST 2018. Contains 318229 sequences. (Running on oeis4.)