login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322318 a(n) = gcd(A003557(n), A048250(n)). 5
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 2, 1, 3, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 3, 2, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
LINKS
FORMULA
a(n) = gcd(A003557(n), A048250(n)).
a(n) = A001615(n) / A322319(n).
MATHEMATICA
a[n_] := If[n == 1, 1, Module[{f=FactorInteger[n]}, GCD[ Times@@ (First[#] ^(Last[#]-1)& /@ f), Times@@((#+1)& @@@ f)]]]; Array[a, 120] (* Amiram Eldar, Dec 05 2018 *)
PROG
(PARI)
A003557(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1]));
A322318(n) = gcd(A048250(n), A003557(n));
CROSSREFS
Cf. also A066086, A322320.
Sequence in context: A219093 A062760 A323163 * A014649 A326568 A279817
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)