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!)
A323160 a(n) = gcd(n, A323159(n)) = gcd(n, A034448(n), A048250(n)). 3
1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 2, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 2, 3, 2, 1, 6, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = gcd(n, A323159(n)) = gcd(A048250(n), A323166(n)).
a(n) = gcd(n, A034448(n), A048250(n)).
PROG
(PARI)
A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; \\ After code in A034448
A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1]));
A323160(n) = gcd(n, gcd(A034448(n), A048250(n)));
CROSSREFS
Sequence in context: A325632 A009194 A324544 * A323166 A007732 A237835
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 09 2019
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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)