id:A110388 - OEIS Search Results

Search: id:A110388

Displaying 1-1 of 1 results found.

page 1

a(n) = F(n)*F(n+1) mod 9, where F(n) = n-th Fibonacci number.

+0
1

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

	OFFSET	`1,2`
	EXAMPLE	`a(5) = 5*8 mod 9 = 4.`
	MAPLE	`with(combinat): a:=n->fibonacci(n)*fibonacci(n+1) mod 9: seq(a(n), n=1..130); (Deutsch)`
	CROSSREFS	`Sequence in context: A004152 A071678 A141329 this_sequence A007507 A065486 A069806` `Adjacent sequences: A110385 A110386 A110387 this_sequence A110389 A110390 A110391`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 27 2005`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 31 2005`

page 1

Search completed in 0.003 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research