The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113924 a(n) = gcd(A113605(n+1), A113605(n)). Also, for n >= 2, a(n) = A113605(n+2) - A113605(n-1). 1
 1, 1, 1, 2, 1, 3, 1, 1, 4, 1, 1, 5, 1, 2, 1, 1, 1, 1, 8, 1, 3, 1, 1, 2, 1, 1, 1, 11, 2, 1, 1, 1, 1, 2, 1, 1, 5, 1, 4, 1, 1, 1, 1, 2, 19, 1, 1, 1, 10, 1, 7, 3, 1, 2, 1, 1, 1, 1, 6, 1, 1, 1, 5, 6, 1, 1, 1, 1, 2, 1, 3, 7, 1, 4, 1, 1, 1, 5, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS MAPLE A113605 := proc(n) option remember ; if n <=3 then 1 ; else A113605(n-3)+gcd(A113605(n-1), A113605(n-2)) ; fi ; end: A113924 := proc(n) gcd(A113605(n+1), A113605(n)) ; end; seq(A113924(n), n=1..80) ; # R. J. Mathar, Jan 31 2008 CROSSREFS Cf. A113605. Sequence in context: A130296 A126705 A263646 * A335124 A262891 A178340 Adjacent sequences:  A113921 A113922 A113923 * A113925 A113926 A113927 KEYWORD more,nonn AUTHOR Leroy Quet, Jan 30 2006 EXTENSIONS More terms from R. J. Mathar, Jan 31 2008 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 August 10 12:39 EDT 2020. Contains 336379 sequences. (Running on oeis4.)