a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).
A261232
a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =9a(4) =21a(5) =50a(6) =124a(7) =320a(8) =850a(9) =2295a(10) =6251a(11) =17113a(12) =47014a(13) =129606a(14) =358839a(15) =998806a(16) =2796094a(17) =7869801a(18) =22251148a(19) =63141640a(20) =179701240a(21) =512744600a(22) =1466635090a(23) =4205423896a(24) =12087339724a(25) =34816804311a(26) =100469592522a(27) =290336059741a(28) =839932833291
External references
- oeis: A261232