OFFSET
2,1
COMMENTS
a(p) = p for any prime p.
LINKS
Paolo P. Lava, Table of n, a(n) for n = 2..500
EXAMPLE
d(4^1) = 3, d(4^2) = 5 then a(4) = 2;
d(9^1) = 3, d(9^2) = 5, d(9^3) = 7, d(9^4) = 9, d(9^5) = 11, then a(9) = 5.
MAPLE
with(numtheory): P:=proc(q) local a, k, n;
for n from 2 to q do a:=tau(n); k:=1;
while a<n do k:=k+1; a:=tau(n^k); od; print(a); od; end: P(10^6);
MATHEMATICA
nn = 100; Table[SelectFirst[Range@ nn, DivisorSigma[0, n^#] > n &], {n, 2, nn}] (* Michael De Vlieger, Mar 17 2016, Version 10 *)
PROG
(PARI) a(n) = {p=1; until (numdiv(n^p) > n, p++); p; } \\ Michel Marcus, Mar 17 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paolo P. Lava, Mar 17 2016
STATUS
approved