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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)). 1
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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

CROSSREFS

Sequence in context: A092825 A135396 A031048 * A152811 A102960 A166151

Adjacent sequences:  A098704 A098705 A098706 * A098708 A098709 A098710

KEYWORD

nonn,base

AUTHOR

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

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 14:19 EST 2012. Contains 206038 sequences.