Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098162
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098162 a(n+1) = smallest number greater than a(n) having with a(n) a common divisor which is used before as such a common divisor at most once; a(1) = 1. +0
2
1, 2, 3, 6, 8, 10, 15, 18, 24, 28, 32, 40, 45, 54, 60, 70, 77, 84, 96, 104, 117, 126, 140, 150, 165, 176, 187, 204, 216, 234, 247, 266, 280, 300, 315, 336, 352, 368, 391, 408, 432, 450, 475, 494, 520, 540, 567, 588, 616, 638, 660, 690, 713, 744, 768, 800, 825 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) - a(n-1) = GCD(a(n),a(n-1) for n>1.

CROSSREFS

Cf. A098163.

Sequence in context: A089422 A051935 A082667 this_sequence A076627 A020489 A002240

Adjacent sequences: A098159 A098160 A098161 this_sequence A098163 A098164 A098165

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Aug 30 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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research