Let p_k = k-th prime, let f((p_k)^n) = m where m is the largest power of p_(k+1) < (p_k)^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 1.
A089576
Let p_k = k-th prime, let f((p_k)^n) = m where m is the largest power of p_(k+1) < (p_k)^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 1.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =2a(4) =3a(5) =4a(6) =4a(7) =4a(8) =5a(9) =5a(10) =6a(11) =6a(12) =6a(13) =7a(14) =7a(15) =7a(16) =7a(17) =7a(18) =8a(19) =8a(20) =8a(21) =8a(22) =8a(23) =9a(24) =10a(25) =10a(26) =10a(27) =11a(28) =11a(29) =11
External references
- oeis: A089576