Let f(k^n) = m where m is the largest power of k+1 < k^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 2.

A089575

Let f(k^n) = m where m is the largest power of k+1 < k^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 2.

Terms

    a(0) =0a(1) =1a(2) =2a(3) =2a(4) =3a(5) =4a(6) =4a(7) =5a(8) =5a(9) =5a(10) =6a(11) =6a(12) =7a(13) =8a(14) =8a(15) =9a(16) =9a(17) =9a(18) =9a(19) =9a(20) =10a(21) =11a(22) =11a(23) =12a(24) =12a(25) =12a(26) =12a(27) =13a(28) =13a(29) =14

External references