login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072051 Smallest solution to GCD[x,Rev[x]]=11^n. 0
11, 121, 1331, 14641, 121110352, 1332213872, 105923336431682, 4676049710123077 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n)=A069554[11^n]

EXAMPLE

a(8)=4676049710123077=(11^8).13.1678009, Rev[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 A088760 A080486

Adjacent sequences:  A072048 A072049 A072050 * A072052 A072053 A072054

KEYWORD

base,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 10 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:08 EST 2012. Contains 206085 sequences.