Explorations of the Collatz Conjecture - Moravian College

elif b mod 3 = 1 then
w:=floor((k-c)/2);
# this is how many branchings will occur above b
count:=count+w;
if w>0 then
for s from 1 to w do
count:=count+branchcount((b*(2ˆ(2*s))-1)/3,k,c+2*s);
od;
fi;
elif b mod 3 = 2 then
v:=ceil((k-c)/2);
count:=count+v;
# this is how many branchings will occur above b
if v>0 then
for r from 1 to v do
count:=count+branchcount((b*(2ˆ(2*r-1))-1)/3,k,c+2*r-1);
od;
fi;
fi;
return(count);
end:
48