login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082902 a(n) = gcd(2^n, sigma(2,n)) = gcd(A000079(n), A001157(n)). 2
1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 4, 1, 2, 1, 2, 2, 4, 2, 2, 2, 1, 2, 4, 2, 2, 4, 2, 1, 4, 2, 4, 1, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 2, 1, 1, 4, 2, 2, 4, 4, 2, 4, 2, 2, 4, 2, 2, 2, 1, 4, 4, 2, 2, 4, 4, 2, 1, 2, 2, 2, 2, 4, 4, 2, 2, 1, 2, 2, 4, 4, 2, 4, 2, 2, 2, 4, 2, 4, 2, 4, 2, 2, 1, 2, 1, 2, 4, 2, 2, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

FORMULA

a(n) = A006519(A001157(n)). - Antti Karttunen, Sep 27 2018

PROG

(PARI) A082902(n) = gcd(2^n, sigma(n, 2)); \\ Antti Karttunen, Sep 27 2018

CROSSREFS

Cf. A000079, A001157, A006519.

Sequence in context: A082071 A082065 A082070 * A123926 A082064 A082055

Adjacent sequences:  A082899 A082900 A082901 * A082903 A082904 A082905

KEYWORD

nonn,mult

AUTHOR

Labos Elemer, Apr 22 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 06:26 EST 2019. Contains 320332 sequences. (Running on oeis4.)