Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^(i1 - 2) + 2^(i2 - 2) + ... + 2^(ik - 2). Also numbers whose binary representation contains no two adjacent 1's.
A003714
Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^(i1 - 2) + 2^(i2 - 2) + ... + 2^(ik - 2). Also numbers whose binary representation contains no two adjacent 1's.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =4a(4) =5a(5) =8a(6) =9a(7) =10a(8) =16a(9) =17a(10) =18a(11) =20a(12) =21a(13) =32a(14) =33a(15) =34a(16) =36a(17) =37a(18) =40a(19) =41a(20) =42a(21) =64a(22) =65a(23) =66a(24) =68a(25) =69a(26) =72a(27) =73a(28) =74a(29) =80
External references
- oeis: A003714