A330749 a(n) = gcd(n, A064989(n)), where A064989 is fully multiplicative with a(2) = 1 and a(prime(k)) = prime(k-1) for odd primes.

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 5, 4, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 5, 1, 4, 1, 1, 3, 1, 7, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 15

Offset

1,6

Links

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

Formula

a(n) = gcd(n, A064989(n)).

a(n) = n / A319626(n).

a(n) = A064989(A322361(n)).

Prog

(PARI) A330749(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); gcd(n, factorback(f)); };

Crossrefs

Cf. A064989, A319626, A322361.

Sequence in context: A102855 A124148 A174435 * A294883 A348940 A088530

Adjacent sequences: A330746 A330747 A330748 * A330750 A330751 A330752

Keyword

nonn

Author

Antti Karttunen, Dec 29 2019

Status

approved