A323071 a(n) = gcd(n, 1+A060681(n)).

1, 2, 3, 1, 5, 2, 7, 1, 1, 2, 11, 1, 13, 2, 1, 1, 17, 2, 19, 1, 3, 2, 23, 1, 1, 2, 1, 1, 29, 2, 31, 1, 1, 2, 1, 1, 37, 2, 3, 1, 41, 2, 43, 1, 1, 2, 47, 1, 1, 2, 1, 1, 53, 2, 5, 1, 3, 2, 59, 1, 61, 2, 1, 1, 1, 2, 67, 1, 1, 2, 71, 1, 73, 2, 3, 1, 1, 2, 79, 1, 1, 2, 83, 1, 1, 2, 1, 1, 89, 2, 1, 1, 3, 2, 1, 1, 97, 2, 1, 1, 101, 2, 103, 1, 1

Offset: 1

Author

Antti Karttunen, Jan 04 2019

Keywords

• nonn

Comments

Differs from A055023 at n = 55, 105, 155, ..., (A323070).

Links

• Antti Karttunen, Table of n, a(n) for n = 1..16384
• Antti Karttunen, Data supplement: n, a(n) computed for n = 1..100000

Crossrefs

Cf. A055023, A060681, A323070, A323072.

Programs

PARI

A060681(n) = (n-if(1==n,n,n/vecmin(factor(n)[,1])));
A323071(n) = gcd(n,1+A060681(n));

Formula

a(n) = gcd(n, 1+A060681(n)).

a(n) = n/A323072(n).