id:A113924 - OEIS Search Results

Search: id:A113924

Displaying 1-1 of 1 results found.

page 1

a(n) = GCD(A113605(n+1),A113605(n)). Also, for n >= 2, a(n) = A113605(n+2) - A113605(n-1).

+0
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; listen)

	OFFSET	`1,4`
	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 (mathar(AT)strw.leidenuniv.nl), Jan 31 2008`
	CROSSREFS	`Cf. A113605.` `Sequence in context: A144220 A130296 A126705 this_sequence A084296 A062534 A143349` `Adjacent sequences: A113921 A113922 A113923 this_sequence A113925 A113926 A113927`
	KEYWORD	`more,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jan 30 2006`
	EXTENSIONS	`More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 31 2008`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research