Repeatedly apply Euler phi to the n-th prime; a(n) is the number of terms in the resulting iteration chain which are not powers of 2 (number of initial iterations until reaching the first power of 2).

A060610

Repeatedly apply Euler phi to the n-th prime; a(n) is the number of terms in the resulting iteration chain which are not powers of 2 (number of initial iterations until reaching the first power of 2).

Terms

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

External references