Number of steps to reach 0 when starting from (2^n)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)).
A255062
Number of steps to reach 0 when starting from (2^n)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)).
Terms
- a(0) =0a(1) =1a(2) =2a(3) =4a(4) =7a(5) =12a(6) =21a(7) =37a(8) =66a(9) =119a(10) =216a(11) =394a(12) =722a(13) =1330a(14) =2464a(15) =4590a(16) =8591a(17) =16143a(18) =30435a(19) =57550a(20) =109115a(21) =207389a(22) =395046a(23) =754028a(24) =1441972a(25) =2762765a(26) =5303467a(27) =10200386a(28) =19656529a(29) =37948282
External references
- oeis: A255062