Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098708
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098708 GCD(A098707(n), A098707(n+1)). +0
2
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; listen)
OFFSET

1,1

COMMENT

a(n) = decimal digit occurring exactly once in A098707(n) and A098707(n+1);

1 < a(n) <= 9.

CROSSREFS

Sequence in context: A064459 A082996 A094382 this_sequence A067394 A076925 A100961

Adjacent sequences: A098705 A098706 A098707 this_sequence A098709 A098710 A098711

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research