|
|
A083258
|
|
a(n) = gcd(A046523(n), n).
|
|
3
|
|
|
1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 3, 16, 1, 6, 1, 4, 3, 2, 1, 24, 1, 2, 1, 4, 1, 30, 1, 32, 3, 2, 1, 36, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 48, 1, 2, 3, 4, 1, 6, 1, 8, 3, 2, 1, 60, 1, 2, 3, 64, 1, 6, 1, 4, 3, 10, 1, 72, 1, 2, 3, 4, 1, 6, 1, 16, 1, 2, 1, 12, 1, 2, 3, 8, 1, 30, 1, 4, 3, 2, 1, 96, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
Table[GCD[n, Times @@ MapIndexed[Prime[First[#2]]^#1 &, Sort[FactorInteger[n][[All, -1]], Greater]]], {n, 98}] (* Michael De Vlieger, May 21 2017 *)
|
|
PROG
|
(PARI)
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ This function from Charles R Greathouse IV, Aug 17 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|