OFFSET
1,2
COMMENTS
Conjecture: a(n) = n if and only if n is prime, 2*prime, 1, 8 or 9.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
A265310:= proc(n) local F, f, tau, a, p, k;
F:= ifactors(n)[2];
tau:= mul(1+f[2], f=F);
k:= 1;
for f in F do
a:= f[2]*tau/2;
p:= f[1];
while add(floor(k/p^j), j=1..ilog[p](k)) < a do k:= p*(1+floor(k/p)) od;
od;
k
end proc:
map(A265310, [$1..100]); # Robert Israel, Dec 07 2015
MATHEMATICA
Table[k = 1; While[! Divisible[k!, Times @@ Divisors@ n], k++]; k, {n, 73}] (* Michael De Vlieger, Dec 06 2015 *)
PROG
(PARI) a007955(n) = if(issquare(n, &n), n^numdiv(n^2), n^(numdiv(n)/2));
a(n) = {k=1; while(k, if(k! % a007955(n)==0, return(k)); k++)}
vector(100, n, a(n)) \\ Altug Alkan, Dec 06 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Gionata Neri, Dec 06 2015
STATUS
approved