OFFSET
0,4
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000
FORMULA
a(n) = b(n,n) with b(0,k) = 0, b(n,k) = k*(n mod 2) + b(floor(n/2),k-1) for n>0. - Alois P. Heinz, Oct 25 2011
EXAMPLE
a(5) = (5-2) + (5-0) = 8 because 5 = 2^2 + 2^0.
a(7) = (7-2) + (7-1) + (7-0) = 18 because 7 = 2^2 + 2^1 + 2^0.
MAPLE
b:= (n, k)-> `if`(n=0, 0, k*(n mod 2)+b(floor(n/2), k-1)):
a:= n-> b(n, n):
seq(a(n), n=0..100); # Alois P. Heinz, Oct 25 2011
PROG
(MATLAB) % n is number of terms to be computed:
function [B] = predAddition(n)
for i = 0:n
k = i;
c = 0;
s = 0;
while(k ~= 0)
if ((i - c) >= 0)
s = s + mod(k, 2)*(i-c);
end
c = c + 1;
k = (k - mod(k, 2))/2;
end
B(i+1) = s;
end
end
CROSSREFS
KEYWORD
AUTHOR
Brian Reed, Oct 21 2011
STATUS
approved