a(n) is the number of iterations of Euler phi function needed to reach 1 starting at n (n is counted).
A049108
a(n) is the number of iterations of Euler phi function needed to reach 1 starting at n (n is counted).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =3a(4) =4a(5) =3a(6) =4a(7) =4a(8) =4a(9) =4a(10) =5a(11) =4a(12) =5a(13) =4a(14) =5a(15) =5a(16) =6a(17) =4a(18) =5a(19) =5a(20) =5a(21) =5a(22) =6a(23) =5a(24) =6a(25) =5a(26) =5a(27) =5a(28) =6a(29) =5
External references
- oeis: A049108