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!)
A072032 a(n) = gcd(2^n, reverse(2^n)) = gcd(2^n, A004086(2^n)) = A055483(2^n). 2
2, 4, 8, 1, 1, 2, 1, 4, 1, 1, 2, 8, 2, 1, 1, 4, 1, 2, 1, 1, 2, 2, 2, 1, 1, 16, 1, 2, 1, 1, 4, 4, 2, 1, 1, 2, 1, 8, 1, 1, 8, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 8, 4, 1, 1, 1, 1, 1, 8, 1, 1, 16, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 8, 1, 1, 1, 1, 1, 1, 8, 1, 2, 2, 1, 1, 1, 1, 1, 1, 16, 1, 8, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
n=12: a(12) = gcd(4096,6904) = 8.
MATHEMATICA
nd[x_, y_] := 10*x+y tn[x_] := Fold[nd, 0, x] red[x_] := Reverse[IntegerDigits[x]] Table[GCD[2^w, tn[red[2^w]]], {w, 1, 128}]
CROSSREFS
Sequence in context: A097625 A371133 A010743 * A365814 A023104 A133145
KEYWORD
nonn,less,base
AUTHOR
Labos Elemer, Jun 07 2002
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 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)