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!)
A071686 Smallest solution to gcd(x, Rev(x)) = 2^n. 11
2, 4, 8, 2192, 21920, 291008, 610688, 2112256, 2131456, 2937856, 25329664, 230465536, 694018048, 2344321024, 4688642048, 2112421888, 65012891648, 650128916480, 4494196736, 63769149440, 637691494400, 23842827272192, 276298064723968, 420127895977984, 4897795987210240 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A069554(2^n).
MATHEMATICA
a[n_] := Block[{k = 2^n}, While[GCD[k, FromDigits@ Reverse@ IntegerDigits@ k] != 2^n, k += 2^n]; k]; Array[a, 17] (* Giovanni Resta, Nov 14 2019 *)
CROSSREFS
Sequence in context: A067499 A135212 A012456 * A296742 A103097 A335750
KEYWORD
nonn,base
AUTHOR
Labos Elemer, Jun 03 2002
EXTENSIONS
a(22)-a(25) from Giovanni Resta, Oct 29 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 November 28 07:32 EST 2023. Contains 367394 sequences. (Running on oeis4.)