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!)
A365454 a(n) = gcd(sigma(n), A156552(2*n)). 3
1, 3, 1, 7, 3, 1, 1, 15, 13, 1, 3, 1, 1, 1, 3, 31, 3, 3, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 1, 63, 3, 1, 1, 1, 1, 5, 7, 1, 3, 3, 1, 3, 3, 1, 3, 1, 1, 3, 9, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 127, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 1, 1, 3, 3, 5, 3, 1, 7, 3, 1, 1, 1, 1, 1, 1, 13, 1, 3, 1, 1, 1, 1, 1, 9, 3, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = gcd(A000203(n), A156552(2*n)).
a(n) = A000203(n) / A365455(n) = A156552(2*n) / A365456(n).
For all n >= 0, a(2^n) = 2^(1+n) - 1 = A000225(1+n).
PROG
(PARI)
A156552(n) = {my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552
A365454(n) = gcd(sigma(n), A156552(2*n));
CROSSREFS
Sequence in context: A297156 A132885 A187818 * A059090 A327990 A133115
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 10 2023
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 September 13 16:05 EDT 2024. Contains 375910 sequences. (Running on oeis4.)