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!)
 A339969 a(n) = gcd(n, A005940(1+n)). 2
 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 3, 1, 1, 1, 25, 1, 9, 1, 1, 3, 1, 1, 11, 1, 7, 1, 1, 1, 1, 1, 1, 21, 1, 1, 45, 1, 1, 1, 49, 1, 1, 1, 1, 9, 1, 7, 1, 1, 1, 5, 1, 1, 1, 1, 13, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 7, 3, 1, 1, 1, 1, 1, 7, 5, 1, 3, 11, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 1, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS Antti Karttunen, Table of n, a(n) for n = 0..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537 FORMULA a(n) = gcd(n, A005940(1+n)). PROG (PARI) A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); }; A339969(n) = gcd(n, A005940(1+n)); CROSSREFS Cf. A005940. Cf. also A322361, A324198, A328231. Sequence in context: A346403 A295924 A123940 * A204120 A342666 A268032 Adjacent sequences:  A339966 A339967 A339968 * A339970 A339971 A339972 KEYWORD nonn AUTHOR Antti Karttunen, Dec 25 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 July 28 13:36 EDT 2021. Contains 346332 sequences. (Running on oeis4.)