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.

0, 1, 2, 2, 3, 4, 4, 5, 5, 5, 6, 6, 7, 8, 8, 9, 9, 9, 9, 9, 10, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 15, 16, 16, 16, 16, 17, 17, 17, 18, 19, 19, 19

Offset

0,3

Links

Table of n, a(n) for n=0..45.

Example

a(5)=4 as f(2^5)=3^3 < 2^5, f(3^3)=4^2 < 3^3, f(4^2)=5 < 4^2 and f(5)=6^0 < 5.

Crossrefs

Sequence in context: A364443 A194175 A194241 * A227737 A194177 A348386

Adjacent sequences: A089572 A089573 A089574 * A089576 A089577 A089578

Keyword

easy,nonn

Author

Naohiro Nomoto, Dec 29 2003

Status

approved