Sorry

[franktaw at netscape.net]

Oops, that would be n = 2^32, with k being 2^33 -- not just presumably,
it's easy to see that phi(n) is a power of 2 iff n is a power of two 
times a
product of distinct Fermat numbers (excluding n=2).  See A003401.

Franklin T. Adams-Watters

-----Original Message-----
From: franktaw at netscape.net

According to the comment in A002181, it's 2^31 (with k presumably being
2^32).

Franklin T. Adams-Watters

-----Original Message-----
From: David W. Wilson <wilson.d at anseri.com>

I meant

What is the smallest n such that the smallest k satisfying
phi(k) = n is EVEN?