|
|
A091456
|
|
Least number k such that n * phi(k) < k, where phi is Euler's totient function.
|
|
4
|
|
|
|
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
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = {k = 1; while (n*eulerphi(k) >= k, k++); k; } \\ Michel Marcus, Sep 25 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|