This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322362 a(n) = gcd(n, A166590(n)), where A166590 is completely multiplicative with a(p) = p+2 for prime p. 7
 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 5, 16, 1, 2, 1, 4, 3, 2, 1, 8, 1, 2, 1, 4, 1, 10, 1, 32, 1, 2, 7, 4, 1, 2, 3, 8, 1, 6, 1, 4, 5, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 3, 2, 1, 20, 1, 2, 9, 64, 5, 2, 1, 4, 1, 14, 1, 8, 1, 2, 5, 4, 1, 6, 1, 16, 1, 2, 1, 12, 1, 2, 1, 8, 1, 10, 1, 4, 3, 2, 1, 32, 1, 2, 1, 4, 1, 2, 1, 8, 105 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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, A166590(n)). a(A037074(n)) = A006512(n). MATHEMATICA a[n_] := If[n == 1, 1, GCD[n, Times@@ ((First[#]+2)^Last[#] &/@FactorInteger[n])]]; Array[a, 120] (* Amiram Eldar, Dec 05 2018~ *) PROG (PARI) A166590(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] += 2); factorback(f); }; A322362(n) = gcd(n, A166590(n)); CROSSREFS Cf. A001359, A006512, A037074, A066086, A166590, A322361. Sequence in context: A118830 A055975 A006519 * A087258 A076775 A218621 Adjacent sequences:  A322359 A322360 A322361 * A322363 A322364 A322365 KEYWORD nonn AUTHOR Antti Karttunen, Dec 05 2018 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 April 21 10:30 EDT 2019. Contains 322328 sequences. (Running on oeis4.)