|
|
A072505
|
|
a(n) = n / (LCM of divisors of n which are <= sqrt(n)).
|
|
2
|
|
|
1, 2, 3, 2, 5, 3, 7, 4, 3, 5, 11, 2, 13, 7, 5, 4, 17, 3, 19, 5, 7, 11, 23, 2, 5, 13, 9, 7, 29, 1, 31, 8, 11, 17, 7, 3, 37, 19, 13, 2, 41, 7, 43, 11, 3, 23, 47, 4, 7, 5, 17, 13, 53, 9, 11, 2, 19, 29, 59, 1, 61, 31, 3, 8, 13, 11, 67, 17, 23, 1, 71, 3, 73, 37, 5, 19, 11, 13, 79, 2, 9, 41, 83
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
If n = p^k for prime p, then a(n) = p^ceiling(k/2).
In particular, a(n) = n if and only if n is prime.
If n = p*q for primes p < q, then a(n) = q. (End)
|
|
EXAMPLE
|
a(20) = 5: the divisors of 20 are 1,2,4,5,10 and 20; a(20) = 20/lcm(1,2,4) = 20/4 = 5.
|
|
MAPLE
|
f:= proc(n) n/ilcm(op(select(t -> t^2 <= n, numtheory:-divisors(n)))) end proc:
|
|
MATHEMATICA
|
lc[n_]:=Module[{c=Select[Divisors[n], #<=Sqrt[n]&]}, n/LCM@@c]; Array[lc, 90] (* Harvey P. Dale, May 18 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|