id:A099427 - OEIS Search Results

Search: id:A099427

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n > 1, a(n) = 1 + greatest common divisor of n and a(n-1).

+0
1

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

	OFFSET	`1,2`
	EXAMPLE	`a(9)=4 because 1+gcd(a(8),9)=1+gcd(3,9)=1+3.`
	MATHEMATICA	`a[1] = 1; a[n_] := a[n] = GCD[n, a[n - 1]] + 1; Table[ a[n], {n, 105}] (from Robert G. Wilson v Nov 18 2004)`
	CROSSREFS	`For position of first occurrence of n see A060401.` `Sequence in context: A162361 A073855 A077982 this_sequence A059964 A087458 A052180` `Adjacent sequences: A099424 A099425 A099426 this_sequence A099428 A099429 A099430`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Gaetan Polard (gaetan27(AT)hotmail.com), Nov 18 2004`
	EXTENSIONS	`Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 18 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research