login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280491 a(n) = gcd(n,A122111(n)). 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = gcd(n,A122111(n)).
a(n) = n / A280490(n).
Other identities. For all n >= 1:
a(A122111(n)) = a(n).
PROG
(Scheme) (definec (A280491 n) (gcd n (A122111 n)))
CROSSREFS
Cf. A122111, A280490, also A280489.
Cf. A088902 (the fixed points, n for which a(n) = n).
Sequence in context: A273730 A369964 A326047 * A157118 A156186 A156233
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 09 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)