a(n) = number of steps required to reach 0 from F(n+2) by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...
A261082
a(n) = number of steps required to reach 0 from F(n+2) by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...
Terms
- a(0) =1a(1) =2a(2) =3a(3) =4a(4) =6a(5) =8a(6) =11a(7) =16a(8) =24a(9) =35a(10) =52a(11) =77a(12) =114a(13) =170a(14) =255a(15) =385a(16) =584a(17) =889a(18) =1358a(19) =2081a(20) =3199a(21) =4932a(22) =7625a(23) =11818a(24) =18357a(25) =28568a(26) =44530a(27) =69504a(28) =108607a(29) =169869
External references
- oeis: A261082