A280491 a(n) = gcd(n,A122111(n)).

1, 2, 1, 1, 1, 6, 1, 1, 9, 2, 1, 2, 1, 2, 3, 1, 1, 3, 1, 20, 3, 2, 1, 2, 1, 2, 1, 4, 1, 30, 1, 1, 3, 2, 1, 3, 1, 2, 3, 4, 1, 6, 1, 4, 5, 2, 1, 2, 1, 5, 3, 4, 1, 1, 1, 56, 3, 2, 1, 6, 1, 2, 1, 1, 1, 6, 1, 4, 3, 10, 1, 3, 1, 2, 75, 4, 1, 6, 1, 4, 1, 2, 1, 84, 1, 2, 3, 8, 1, 10, 1, 4, 3, 2, 1, 2, 1, 1, 1, 1, 1, 6, 1, 8, 15, 2, 1, 1, 1, 10, 3, 8, 1, 6, 1, 4, 1, 2

Offset: 1

Author

Antti Karttunen, Jan 09 2017

Keywords

• nonn

Links

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

Crossrefs

Cf. A122111, A280490, also A280489.

Cf. A088902 (the fixed points, n for which a(n) = n).

Programs

Scheme

(definec (A280491 n) (gcd n (A122111 n)))

Formula

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

a(n) = n / A280490(n).

Other identities. For all n >= 1:

a(A122111(n)) = a(n).