id:A097594 - OEIS Search Results

Search: id:A097594

Displaying 1-1 of 1 results found.

page 1

a(0) = 3, a(1) = 2, a(n) = Mod[a(n-1),a(n-2)] + a(n-2) for n > 1.

+0
1

2, 5, 3, 8, 5, 13, 8, 21, 13, 34, 21, 55, 34, 89, 55, 144, 89, 233, 144, 377, 233, 610, 377, 987, 610, 1597, 987, 2584, 1597, 4181, 2584, 6765, 4181, 10946, 6765, 17711, 10946, 28657, 17711, 46368 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`a(2n) = F(n+4), a(2n+1) = F(n+3) = A000045(n+3) where F(m) is the m-th Fibonacci number. a(n) = A053602(n+5) = A051792(n+11)`
	CROSSREFS	`Cf. A000045 A053602 A051792.` `Sequence in context: A021398 A115318 A063955 this_sequence A050171 A136189 A081146` `Adjacent sequences: A097591 A097592 A097593 this_sequence A097595 A097596 A097597`
	KEYWORD	`nonn`
	AUTHOR	`Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Aug 29 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research