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!)
A344704 a(n) = gcd(A001615(n)-n, sigma(n)-(A001615(n)+n)). 3
1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 12, 1, 2, 1, 20, 1, 6, 1, 1, 3, 2, 1, 1, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 1, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 11, 1, 1, 6, 1, 10, 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, 5, 3, 1, 1, 6, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = gcd(A306927(n), n-A244963(n)) = gcd(A001615(n)-n, sigma(n)-(A001615(n)+n)).
PROG
(PARI)
A001615(n) = if(1==n, n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
A344704(n) = gcd(A001615(n)-n, sigma(n)-(A001615(n)+n));
CROSSREFS
Sequence in context: A333461 A325975 A325813 * A325633 A325640 A325632
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 28 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

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