login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098707 a(1) = 2; for n > 1, a(n) is the 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; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..54.

CROSSREFS

Sequence in context: A135396 A031048 A294554 * A152811 A294552 A294170

Adjacent sequences:  A098704 A098705 A098706 * A098708 A098709 A098710

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Sep 21 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 26 07:31 EDT 2022. Contains 354877 sequences. (Running on oeis4.)