Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072005
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072005 Smallest solution to GCD[x,Rev[x]]=3^n. +0
7
1, 3, 9, 2889, 2899999989, 4899999987, 19899999972, 29898999693, 49989958299, 49999917897, 99884394999, 372797889885, 1989767716659, 2678052898989, 17902896898419 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=A069554[3^n]

EXAMPLE

n=4, 3^4=81, a(4)=2899999989=3.3.3.3.35802469, Rev[a(4)]=2.3.3.3.3.61111111; GCD=81=3^n.

CROSSREFS

Cf. A004086, A055483, A069554, A071686.

Sequence in context: A112725 A060712 A122463 this_sequence A060377 A027896 A057269

Adjacent sequences: A072002 A072003 A072004 this_sequence A072006 A072007 A072008

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 04 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research