a(n) = number of steps required to reach 0 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, ...
A261081
a(n) = number of steps required to reach 0 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) =2a(3) =3a(4) =5a(5) =7a(6) =10a(7) =15a(8) =23a(9) =34a(10) =51a(11) =76a(12) =113a(13) =169a(14) =254a(15) =384a(16) =583a(17) =888a(18) =1357a(19) =2080a(20) =3198a(21) =4931a(22) =7624a(23) =11817a(24) =18356a(25) =28567a(26) =44529a(27) =69503a(28) =108606a(29) =169868
External references
- oeis: A261081