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

A049116

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

Terms

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

External references