Replace 2^k in binary expansion of n with Fibonacci(k+2).

Terms

a(0) =0a(1) =1a(2) =2a(3) =3a(4) =3a(5) =4a(6) =5a(7) =6a(8) =5a(9) =6a(10) =7a(11) =8a(12) =8a(13) =9a(14) =10a(15) =11a(16) =8a(17) =9a(18) =10a(19) =11a(20) =11a(21) =12a(22) =13a(23) =14a(24) =13a(25) =14a(26) =15a(27) =16a(28) =16a(29) =17