The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159782 a(0)=1; a(1)=a(2)=a(3)=a(4)=2; a(2n+1)=0 for n >= 2; a(4n)=a(4n-2) = a(n) + a(n+1) for n >= 2. 1
 1, 2, 2, 2, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 2, 0, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) = {0, 1, 2 or 4}. - Robert G. Wilson v, May 27 2009 Also the number of palindromes of length n in the Thue-Morse sequence (A010060). - Jeffrey Shallit, Feb 19 2013 LINKS G. C. Greubel, Table of n, a(n) for n = 0..10000 A. Blondin-Massé, S. Brlek, A. Garon, and S. Labbé, Combinatorial properties of f-palindromes in the Thue-Morse Sequence, Pure. Math. Appl., 19 (2-3) (2008), 39-52. MATHEMATICA f[n_] := f[n]= Switch[ Mod[n, 4], 0, f[n/4] + f[n/4 + 1], 1, 0, 2, f[(n + 2)/4] + f[(n + 6)/4], 3, 0]; f[0] = 1; f[1] = f[2] = f[3] = f[4] = 2; Table[f@n, {n, 0, 104}] (* Robert G. Wilson v, May 27 2009 *) CROSSREFS Cf. A010060. Sequence in context: A127444 A241477 A268243 * A268242 A309509 A216953 Adjacent sequences:  A159779 A159780 A159781 * A159783 A159784 A159785 KEYWORD easy,nonn AUTHOR Philippe Deléham, Apr 22 2009 EXTENSIONS More terms from Robert G. Wilson v, May 27 2009 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 October 1 11:59 EDT 2020. Contains 337443 sequences. (Running on oeis4.)