Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072051 Smallest solution to GCD[x,Rev[x]]=11^n. +0
1
11, 121, 1331, 14641, 121110352, 1332213872, 105923336431682, 4676049710123077 (list; graph; listen)
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: A001020 A055479 A003590 this_sequence A092846 A088760 A080486

Adjacent sequences: A072048 A072049 A072050 this_sequence A072052 A072053 A072054

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research