a(n) = gcd(2^n, n - phi(n)); largest power of 2 dividing cototient(n) = A051953(n).
A082506
a(n) = gcd(2^n, n - phi(n)); largest power of 2 dividing cototient(n) = A051953(n).
Terms
- a(0) =2a(1) =1a(2) =1a(3) =2a(4) =1a(5) =4a(6) =1a(7) =4a(8) =1a(9) =2a(10) =1a(11) =8a(12) =1a(13) =8a(14) =1a(15) =8a(16) =1a(17) =4a(18) =1a(19) =4a(20) =1a(21) =4a(22) =1a(23) =16a(24) =1a(25) =2a(26) =1a(27) =16a(28) =1a(29) =2
External references
- oeis: A082506