Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072051
Smallest k such that gcd(k, reverse(k)) = 11^n.
0
11, 121, 1331, 14641, 121110352, 1332213872, 105923336431682, 4676049710123077, 36606937477221265, 30983951005022964839, 1365869521861436622239
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Table of n, a(n) for n=1..11.
FORMULA
a(n) = A069554(11^n).
EXAMPLE
a(8) = 4676049710123077 = (11^8)*13*1678009, reverse(a(8)) = 7703210179406764 = (11^8)*2*2*157*57223.
CROSSREFS
Cf. A004086, A055483, A069554, A071686 (=2^n), A072005 (=3^n), A072021 (=5^n), A072050 (=7^n).
Sequence in context: A055479 A195946 A003590 * A092846 A329734 A214993
Adjacent sequences: A072048 A072049 A072050 * A072052 A072053 A072054
KEYWORD
base,nonn
AUTHOR
Labos Elemer, Jun 10 2002
EXTENSIONS
a(9)-a(11) from Sean A. Irvine, Sep 02 2024
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 29 00:07 EDT 2024. Contains 376297 sequences.
License Agreements, Terms of Use, Privacy Policy