%N a(0)=0, a(1)=1, a(2)=0; thereafter, a(2n)=a(n)+a(n+1) for n >= 2, a(2n+1)=a(n) for n >= 1.
%C A "bow" sequence. The bow sequences are a family of recursive sequences defined to have the flipped recursion from the Stern sequence A002487 (called bow for the opposite end of the boat from the stern). The bow sequences require two initial conditions: a(1)=alpha, a(2)=beta. We also define a(0)=0, although it does not enter into the recursion.
%C The bow sequences then follow the recursion a(2n)=a(n)+a(n+1) for n at least 2, and a(2n+1)=a(n). This particular bow sequence has initial conditions a(1)=0, a(2)=1 and (along with the sequence A106345 with initial conditions a(1)=1, a(2)=0) is of particular importance when studying the general bow sequences.
%H Rémy Sigrist, <a href="/A281185/b281185.txt">Table of n, a(n) for n = 0..25000</a>
%H M. Dennison, <a href="http://hdl.handle.net/2142/16821">A Sequence Related to the Stern Sequence</a>, Ph.D. dissertation, University of Illinois at Urbana-Champaign, 2010.
%H Melissa Dennison, <a href="https://www.emis.de/journals/JIS/VOL22/Dennison/dennis3.html">On Properties of the General Bow Sequence</a>, J. Int. Seq., Vol. 22 (2019), Article 19.2.7.
%e a(3)=a(1)=1, a(4)=a(2)+a(3)=0+1=1, a(5)=a(2)=0.
%p f:=proc(n) option remember;
%p if n=0 then 0
%p elif n=1 then 1
%p elif n=2 then 0
%p if n mod 2 = 0 then f(n/2)+f(1+n/2) else f((n-1)/2) fi;
%p [seq(f(n),n=0..150)]; # _N. J. A. Sloane_, Apr 26 2017
%t b=0; b=1; b=0; b[n_?EvenQ]:=b[n]=b[n/2]+b[n/2+1]; b[n_?OddQ]:=b[n]=b[(n-1)/2]
%Y Cf. A002487, A106345.
%A _Melissa Dennison_, Apr 12 2017
%E Edited by _N. J. A. Sloane_, Apr 26 2017