OFFSET
1,1
COMMENTS
By Mertens' theorem and the Prime Number Theorem log log a(n) ~ n / e^gamma. - Charles R Greathouse IV, Sep 07 2012
PROG
(PARI) a(n) = {k = 1; while (n*eulerphi(k) >= k, k++); k; } \\ Michel Marcus, Sep 25 2013
(PARI) a(n)=my(k=1); forprime(p=2, , if(n*eulerphi(k)<k, return(k), k*=p)) \\ Charles R Greathouse IV, Sep 25 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Jan 10 2004
STATUS
approved