A280489 a(n) = gcd(n,A241909(n)).

1, 2, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 5, 1, 1, 1, 1, 5, 3, 1, 1, 3, 1, 7, 3, 1, 1, 5, 1, 1, 1, 1, 1, 3, 1, 1, 3, 5, 1, 1, 1, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 7, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 25, 1, 3, 1, 1, 15, 1, 1, 1, 1, 5, 3, 1, 1, 3, 1, 1, 1, 1, 1

Offset

1,2

Links

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

Formula

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

a(n) = n / A280488(n).

Other identities. For all n >= 1:

a(A241909(n)) = a(n).

Prog

(Scheme) (define (A280489 n) (gcd n (A241909 n)))

Crossrefs

Cf. A241909, A280488, A280491.

Sequence in context: A136178 A047140 A047150 * A289356 A269977 A238710

Adjacent sequences: A280486 A280487 A280488 * A280490 A280491 A280492

Keyword

nonn

Author

Antti Karttunen, Jan 09 2017

Status

approved