Smallest positive k such that phi(1+k*2^m) <= phi(k*2^m) for all m = n (mod 12), where phi is Euler's totient function.

A091025

Smallest positive k such that phi(1+k*2^m) <= phi(k*2^m) for all m = n (mod 12), where phi is Euler's totient function.

Terms

    a(0) =104a(1) =52a(2) =26a(3) =13a(4) =59a(5) =82a(6) =41a(7) =73a(8) =89a(9) =97a(10) =101a(11) =103

External references