id:A137866 - OEIS Search Results

Search: id:A137866

Displaying 1-1 of 1 results found.

page 1

a(1)=0. For n >= 2, a(n) = GCD(a(n-1)+1, n).

+0
1

0, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 5, 6, 1, 2, 3, 2 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Starting with a(1)=1 instead leads to a(n) = n for every positive integer n.`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	CROSSREFS	`Sequence in context: A107286 A087039 A102096 this_sequence A072203 A124044 A059981` `Adjacent sequences: A137863 A137864 A137865 this_sequence A137867 A137868 A137869`
	KEYWORD	`more,nonn`
	AUTHOR	`Leroy Quet, Apr 29 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research