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