The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324046 a(n) = gcd(n, A106316(n)). 5
 1, 1, 1, 1, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 3, 2, 1, 6, 1, 4, 1, 2, 1, 12, 1, 2, 1, 28, 1, 6, 1, 1, 3, 2, 1, 3, 1, 2, 1, 10, 1, 6, 1, 4, 9, 2, 1, 12, 1, 1, 3, 2, 1, 18, 1, 8, 1, 2, 1, 12, 1, 2, 3, 1, 1, 6, 1, 2, 3, 2, 1, 12, 1, 2, 3, 4, 1, 6, 1, 8, 3, 2, 1, 28, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 48, 1, 1, 9, 4, 1, 6, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 FORMULA a(n) = gcd(n, A106316(n)). PROG (PARI) A106315(n) = (n*numdiv(n) % sigma(n)); A106316(n) = (A106315(n) % n); A324046(n) = gcd(n, A106316(n)); CROSSREFS Cf. A000005, A000203, A106315, A106316, A324045, A324047. Sequence in context: A111825 A085552 A002950 * A244059 A121090 A321991 Adjacent sequences:  A324043 A324044 A324045 * A324047 A324048 A324049 KEYWORD nonn AUTHOR Antti Karttunen, Feb 13 2019 STATUS approved

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

Last modified January 28 00:32 EST 2020. Contains 331313 sequences. (Running on oeis4.)