Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072016
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072016 GCD[n,Rev[n]] = 27 = 3^3, where Rev[x] = A004086[x]. +0
4
2889, 3699, 3888, 3969, 4779, 4887, 5589, 5697, 5778, 5859, 5886, 5967, 6399, 6669, 6777, 6885, 6939, 7398, 7479, 7587, 7668, 7695, 7749, 7776, 7857, 7884, 7938, 7965, 8289, 8397, 8559, 8667, 8775, 8829, 8883, 8937, 9099, 9288, 9369, 9396, 9477, 9558 (list; graph; listen)
OFFSET

1,1

EXAMPLE

2889=107.3.3.3, 9889=3.3.3.3.2.61 Solutions to 1,3,9 (lower powers of 3) are trivial [See A072005].

CROSSREFS

Cf. A004086, A055483, A069554, A071686, A072005.

Sequence in context: A035895 A035775 A107571 this_sequence A061663 A054828 A054829

Adjacent sequences: A072013 A072014 A072015 this_sequence A072017 A072018 A072019

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 05 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research