Repeatedly apply Euler phi to n-th prime; a(n) = highest power of 2 that is seen.

A060609

Repeatedly apply Euler phi to n-th prime; a(n) = highest power of 2 that is seen.

Terms

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

External references