This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129088 a(1)=a(2)=1; a(n) = gcd(a(n-1), n) + gcd(a(n-2), n). 1
 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; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS a(2n) is odd for all n >= 1. a(2n-1) is even for all n >= 2. LINKS 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, Apr 04 2007 CROSSREFS Cf. A129089. Sequence in context: A101876 A260218 A087986 * A086418 A100761 A027748 Adjacent sequences:  A129085 A129086 A129087 * A129089 A129090 A129091 KEYWORD nonn AUTHOR Leroy Quet, Mar 29 2007 EXTENSIONS More terms from Emeric Deutsch, Apr 04 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 17 08:09 EDT 2019. Contains 328106 sequences. (Running on oeis4.)