id:A113925 - OEIS Search Results

Search: id:A113925

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`1,4`
	COMMENT	`a(1)'s value is arbitrary. Replacing a(1) with any integer would not alter the rest of the sequence.`
	EXAMPLE	`a(14) = GCD(a(13)+a(12),12) = GCD(1+2,12) = GCD(3,12) = 3.`
	MAPLE	`a[1]:=0: a[2]:=1: for n from 3 to 135 do a[n]:=gcd(a[n-1]+a[n-2], n-2) od: seq(a[n], n=1..117); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 07 2006`
	CROSSREFS	`Sequence in context: A135508 A030413 A139434 this_sequence A105083 A120966 A055444` `Adjacent sequences: A113922 A113923 A113924 this_sequence A113926 A113927 A113928`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jan 30 2006`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 07 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research