login
A073067
Minimum value of abs(prime(n)-k*tau(k)) for k>0.
0
1, 1, 1, 1, 1, 1, 3, 3, 1, 2, 1, 1, 1, 3, 1, 3, 1, 1, 5, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 5, 5, 1, 1, 1, 2, 1, 1, 3, 1, 5, 1, 3, 1, 1, 3, 3, 3, 3, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 5, 3, 1, 1, 1, 3, 3, 1, 1, 1, 5, 1, 3, 1, 1, 1, 3, 1, 3, 1, 3, 1, 1, 1, 5, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 5, 3, 1, 5, 3, 1, 1, 1
OFFSET
1,7
FORMULA
It seems that if n > 1 then sum(k=1, n, a(kn)) > n*Log(Log(n)).
PROG
(PARI) a(n)=vecmin(vector(prime(n), k, abs(prime(n)-k*numdiv(k))))
CROSSREFS
Sequence in context: A063421 A368339 A244328 * A003637 A317413 A359838
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Aug 17 2002
STATUS
approved