1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:

test:=proc(b::posint)
local i,j,n,k,s:=0,t;
  for j to 2^b-1 do
    n:=j;
    k:=floor(log[2](n));
    t:=2*i^(k+1);
    while n>0 do
      if n>=2^k then
         n:=n-2^k; t:=t-i^(k+1)
      end if;
      k:=k-1
      end do;
    s:=s+g(t)
   end do; 
   return s
end:

test(4);