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!)
 A337335 a(n) = gcd(A048673(n), 1+A003973(n)). 3
 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 19, 1, 13, 1, 1, 1, 13, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = gcd(A048673(n), 1+A003973(n)) = (n) = gcd((1+A003961(n))/2, 1+sigma(A003961(n))). For all n>= 1, a(A000290(n)) = A337337(n). PROG (PARI) A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; A337335(n) = { my(s=A003961(n)); gcd((1+s)/2, 1+sigma(s)); }; CROSSREFS Cf. A003961, A003973, A048673, A337337, A337342 (positions where equal to A048673). Cf. also A336850. Sequence in context: A260237 A118135 A318671 * A109014 A268357 A321804 Adjacent sequences:  A337332 A337333 A337334 * A337336 A337337 A337338 KEYWORD nonn AUTHOR Antti Karttunen, Aug 24 2020 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 September 26 20:34 EDT 2021. Contains 347672 sequences. (Running on oeis4.)