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!)
A072051 Smallest k such that gcd(k, reverse(k)) = 11^n. 0

%I #8 Sep 04 2017 23:24:16

%S 11,121,1331,14641,121110352,1332213872,105923336431682,

%T 4676049710123077

%N Smallest k such that gcd(k, reverse(k)) = 11^n.

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

%e a(8) = 4676049710123077 = (11^8)*13*1678009, reverse(a(8)) = 7703210179406764 = (11^8)*2*2*157*57223.

%Y Cf. A004086, A055483, A069554, A071686 (=2^n), A072005 (=3^n), A072021 (=5^n), A072050 (=7^n).

%K base,nonn

%O 1,1

%A _Labos Elemer_, Jun 10 2002

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 May 8 08:52 EDT 2024. Contains 372330 sequences. (Running on oeis4.)