a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 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, ...

A261091

a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 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) =0a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =3a(7) =5a(8) =8a(9) =11a(10) =17a(11) =25a(12) =37a(13) =56a(14) =85a(15) =130a(16) =199a(17) =305a(18) =469a(19) =723a(20) =1118a(21) =1733a(22) =2693a(23) =4193a(24) =6539a(25) =10211a(26) =15962a(27) =24974a(28) =39103a(29) =61262

External references