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!)
 A342416 a(n) = gcd(A173557(n), A342001(n)). 5
 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 8, 1, 1, 1, 1, 4, 2, 1, 1, 1, 2, 3, 1, 2, 1, 1, 1, 1, 2, 1, 12, 2, 1, 3, 8, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 4, 4, 1, 1, 8, 1, 2, 1, 1, 2, 1, 3, 1, 1, 6, 1, 1, 4, 2, 1, 1, 1, 1, 3, 1, 2, 6, 1, 1, 2, 2, 1, 1, 2, 2, 3, 8, 5, 1, 1, 4, 2, 2, 1, 24, 1, 1, 1, 5, 2, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A342413(n) / A003557(n) = gcd(A173557(n), A342001(n)). MATHEMATICA Array[GCD[#2, #1/#3] & @@ {If[#1 < 2, 0, #1 Total[#2/#1 & @@@ #2]], If[#1 == 1, 1, Times @@ Map[# - 1 &, #2[[All, 1]] ]], #1/Times @@ #2[[All, 1]]} & @@ {Abs[#], FactorInteger[#]} &, 91] (* Michael De Vlieger, Mar 11 2021 *) PROG (PARI) A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1])); A003557(n) = (n/factorback(factorint(n)[, 1])); A342413(n) = gcd(eulerphi(n), A003415(n)); A342416(n) = (A342413(n)/A003557(n)); CROSSREFS Cf. A000010, A003415, A003557, A173557, A342001, A342413. Sequence in context: A071628 A033809 A046067 * A305531 A132066 A102190 Adjacent sequences:  A342413 A342414 A342415 * A342417 A342418 A342419 KEYWORD nonn AUTHOR Antti Karttunen, Mar 11 2021 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 29 09:41 EDT 2021. Contains 346344 sequences. (Running on oeis4.)