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!)
 A323071 a(n) = gcd(n, 1+A060681(n)). 5
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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 FORMULA a(n) = gcd(n, 1+A060681(n)). a(n) = n/A323072(n). PROG (PARI) A060681(n) = (n-if(1==n, n, n/vecmin(factor(n)[, 1]))); A323071(n) = gcd(n, 1+A060681(n)); CROSSREFS Cf. A055023, A060681, A323070, A323072. Sequence in context: A306807 A021816 A055023 * A340078 A126773 A326691 Adjacent sequences:  A323068 A323069 A323070 * A323072 A323073 A323074 KEYWORD nonn AUTHOR Antti Karttunen, Jan 04 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 June 15 15:16 EDT 2021. Contains 345049 sequences. (Running on oeis4.)