|
%I #15 Jun 01 2013 14:24:54
%S 0,-1,1,-4,5,-4,2,-11,13,-4,6,-15,14,-11,3,-26,29,-4,14,-23,26,-15,7,
%T -38,38,-11,15,-38,31,-26,4,-57,61,-4,30,-39,50,-23,15,-62,66,-15,27,
%U -58,51,-38,8,-85,86,-11,39,-62,67,-38,16,-93,87,-26,32,-85,64,-57,5
%N a(n) = if n=0 then 0 else a(floor(n/2))+n*(-1)^(n mod 2).
%H Reinhard Zumkeller, <a href="/A071413/b071413.txt">Table of n, a(n) for n = 0..10000</a>
%H Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences with (relatively) simple ordinary generating functions</a>.
%H Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%o (Haskell)
%o a071413 0 = 0
%o a071413 n | m == 0 = a071413 n' + n
%o | otherwise = a071413 n' - n where (n',m) = divMod n 2
%o -- _Reinhard Zumkeller_, Jun 01 2013
%Y Cf. A005187.
%K sign
%O 0,4
%A _Reinhard Zumkeller_, Jun 24 2000
|
