a(n)=bt _ df2tree _ apply _ k _ times(2,n)
bt_df2tree_apply_k_times:=进程(n,k)选项记忆;如果(0=k),则(n)其他bt _df2tree _ apply _ k _times(bintree _ depth _ first2树(n),k-1);fi;结束;
bintree_depth_first2树:=n->((btdf2t(n*2,floor_log_2(n)+1)/2)-2^(2*(floor_log_2(n)+1));
btdf2t:=进程(n,ii)局部i,e,x,y;i:=ii;如果(n>=(2^i)),则x:=btdf2t(n-(2^i),i-1);i:=i-((地板_日志2(x)+1)/2);y:=btdf2t((n模(2^i)),i-1);返回((2^(floor_log_2(y)+2))*((2#(floor_log_2(x)+1))+x)+2*y);否则返回(2);fi;结束;
|