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!)
A072005 Smallest solution to gcd(k, reverse(k)) = 3^n. 7

%I #12 Oct 30 2019 04:41:25

%S 1,3,9,2889,2899999989,4899999987,19899999972,29898999693,49989958299,

%T 49999917897,99884394999,372797889885,1989767716659,2678052898989,

%U 17902896898419,137530987695297,189281899170567,368055404997498,14048104419899757,437893473401621955,218264275944702783

%N Smallest solution to gcd(k, reverse(k)) = 3^n.

%F a(n) = A069554(3^n).

%e n=4: 3^4 = 81, a(4) = 2899999989 = 3*3*3*3*35802469, reverse(a(4)) = 2*3*3*3*3*61111111; gcd = 81 = 3^n.

%Y Cf. A004086, A055483, A069554, A071686, A071686, A072021, A072050.

%K nonn,base

%O 0,2

%A _Labos Elemer_, Jun 04 2002

%E a(15)-a(20) from _Giovanni Resta_, Oct 30 2019

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)