Number of steps to reach 0 when starting from (2^n)-2 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000918(n)).
A255061
Number of steps to reach 0 when starting from (2^n)-2 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000918(n)).
Terms
- a(0) =0a(1) =1a(2) =3a(3) =6a(4) =11a(5) =20a(6) =36a(7) =65a(8) =118a(9) =215a(10) =393a(11) =721a(12) =1329a(13) =2463a(14) =4589a(15) =8590a(16) =16142a(17) =30434a(18) =57549a(19) =109114a(20) =207388a(21) =395045a(22) =754027a(23) =1441971a(24) =2762764a(25) =5303466a(26) =10200385a(27) =19656528a(28) =37948281a(29) =73384080
External references
- oeis: A255061