Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098707
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098707 a(1) = 2 and for n>1: a(n) = smallest number m greater than a(n-1) with a digit d>1 occurring exactly once in decimal representations of m and a(n-1) and d=GCD(m,a(n-1)). +0
2
2, 12, 26, 28, 62, 72, 82, 92, 102, 112, 142, 152, 162, 168, 184, 204, 206, 208, 210, 214, 216, 218, 230, 234, 236, 238, 240, 254, 256, 258, 260, 266, 268, 270, 274, 276, 278, 280, 286, 288, 290, 294, 296, 298, 302, 312, 315, 318, 321, 324, 326, 328, 342, 345 (list; graph; listen)
OFFSET

1,1

COMMENT

A098708(n) = GCD(a(n),a(n+1)).

CROSSREFS

Sequence in context: A092825 A135396 A031048 this_sequence A152811 A102960 A166151

Adjacent sequences: A098704 A098705 A098706 this_sequence A098708 A098709 A098710

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 21 2004

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research