|
| |
|
|
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
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
