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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #2 Mar 30 2012 17:34:23
%S 0,1,2,2,3,3,3,5,3,6,4,7,4,7,4,11,3,12,4,13,5,14,5,15,4,17,5,17,5,17,
%T 5,22,3,23,4,24,5,25,5,27,5,29,6,29,6,29,6,32,4,33
%N Semi-chaotic binary digit sum/product sequence modeled on a Rudin-Shapiro-type sequence like A014081.
%F a(n)=Sum[1 - Mod[n - Floor[n/2^m], 2]Mod[n - Floor[n/2^(m - 1)], 2],{m, 1, Floor[(n)*Log[2]]}]
%t Clear[s, k, n] k[n_] := Apply[Plus, Table[1 - Mod[n - Floor[n/2^m], 2]Mod[n - Floor[n/2^(m - 1)], 2], {m, 1, Floor[(n)*Log[2]]}]]; a = Table[k[n], {n, 1, 50}]
%Y Cf. A014081.
%K nonn,uned
%O 1,3
%A _Roger L. Bagula_, Mar 24 2008