|
|
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
|
Also the number of palindromes of length n in the Thue-Morse sequence (A010060). - Jeffrey Shallit, Feb 19 2013
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|