A083259 a(n) = gcd(n, A071364(n)), where A071364(n) is the smallest number with same sequence of exponents in canonical prime factorization as n.

1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 3, 16, 1, 18, 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, 54, 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, 90, 1, 4, 3, 2, 1, 96, 1

Offset

1,2

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Prog

(PARI)
A071364(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 1] = prime(i)); factorback(f); }; \\ From A071364
A083259(n) = gcd(A071364(n), n); \\ Antti Karttunen, Jan 22 2020

Crossrefs

Cf. A007395, A002808, A046523, A071364, A083255-A083260, A322361, A330749.

Sequence in context: A193267 A327832 A083258 * A342242 A214060 A009531

Adjacent sequences: A083256 A083257 A083258 * A083260 A083261 A083262

Keyword

nonn

Author

Labos Elemer, May 09 2003

Status

approved