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!)
A325385 a(n) = gcd(n-A048250(n), n-A162296(n)). 18
1, 1, 1, 1, 1, 6, 1, 1, 5, 2, 1, 4, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 12, 19, 2, 1, 4, 1, 6, 1, 1, 3, 2, 1, 1, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 4, 41, 1, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 3, 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, 1, 3, 1, 1, 6, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = gcd(n-A048250(n), n-A162296(n)).
a(n) = gcd(A325313(n), A325314(n)).
a(A228058(n)) = A325375(n).
PROG
(PARI)
A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1]));
A162296(n) = sumdiv(n, d, d*(1-issquarefree(d)));
A325385(n) = gcd(n-A048250(n), n-A162296(n));
CROSSREFS
Sequence in context: A155824 A335505 A182429 * A195385 A319990 A138073
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 24 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 April 24 13:15 EDT 2024. Contains 371948 sequences. (Running on oeis4.)