Let phi_m(x) denote the Euler totient function applied m times to x. Sequence gives the minimum number of iterations m such that phi_m(n) divides n.

A073407

Let phi_m(x) denote the Euler totient function applied m times to x. Sequence gives the minimum number of iterations m such that phi_m(n) divides n.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =1a(6) =3a(7) =1a(8) =3a(9) =2a(10) =4a(11) =1a(12) =4a(13) =2a(14) =4a(15) =1a(16) =5a(17) =1a(18) =4a(19) =2a(20) =4a(21) =3a(22) =5a(23) =1a(24) =5a(25) =3a(26) =4a(27) =2a(28) =5a(29) =3

External references