A328231 a(n) = gcd(n, A048673(n)).

1, 2, 3, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 4, 7, 2, 1, 4, 25, 26, 9, 2, 1, 1, 1, 2, 33, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 4, 1, 1, 1, 4, 1, 1, 3, 88, 1, 1, 1, 1, 93, 2, 1, 32, 1, 14, 1, 1, 1, 1, 1, 2, 1

Offset

1,2

Links

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

Formula

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

Prog

(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A328231(n) = gcd(n, A048673(n));

Crossrefs

Cf. A003961, A048673.

Cf. also A085731, A322361, A324198, A327858.

Sequence in context: A139434 A113925 A373248 * A180466 A105083 A372571

Adjacent sequences: A328228 A328229 A328230 * A328232 A328233 A328234

Keyword

nonn

Author

Antti Karttunen, Oct 08 2019

Status

approved