id:A129088 - OEIS Search Results

Search: id:A129088

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`1,3`
	COMMENT	`a(2n) is odd for all n >=1. a(2n-1) is even for all n >=2.`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	MAPLE	`a[1]:=1: a[2]:=1: for n from 3 to 140 do a[n]:=gcd(a[n-1], n)+gcd(a[n-2], n) od: seq(a[n], n=1..140); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 04 2007`
	CROSSREFS	`Cf. A129089.` `Sequence in context: A094290 A101876 A087986 this_sequence A086418 A100761 A027748` `Adjacent sequences: A129085 A129086 A129087 this_sequence A129089 A129090 A129091`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Mar 29 2007`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 04 2007`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research