The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098708 a(n) = gcd(A098707(n), A098707(n+1)). 1
 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 9, 9, 9, 9, 9, 9, 7, 7, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = decimal digit occurring exactly once in A098707(n) and A098707(n+1); 1 < a(n) <= 9. LINKS CROSSREFS Sequence in context: A146167 A103380 A309120 * A067394 A076925 A100961 Adjacent sequences:  A098705 A098706 A098707 * A098709 A098710 A098711 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 04:17 EDT 2020. Contains 334696 sequences. (Running on oeis4.)