Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076919
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076919 a(1) = 1, a(2) = 2, then a(n+1) is the smallest number such that the highest common factor of a(n) and a(n+1) is different from that of a(n) and a(n-1) and is more than 1. +0
2
1, 2, 4, 8, 10, 15, 18, 20, 24, 26, 39, 42, 44, 48, 50, 55, 66, 68, 72, 74, 111, 114, 116, 120, 122, 183, 186, 188, 192, 194 (list; graph; listen)
OFFSET

1,2

EXAMPLE

15 follows 10 as (8,10) = 2 so 12 and 14 are ruled out.

CROSSREFS

Cf. A076920.

Sequence in context: A049422 A067925 A102431 this_sequence A128106 A125021 A085406

Adjacent sequences: A076916 A076917 A076918 this_sequence A076920 A076921 A076922

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 17 2002

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research