A110388 - OEIS

This site is supported by donations to The OEIS Foundation.

A110388

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

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; refs; listen; history; internal format)

	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 * A007507 A065486 A069806` `Adjacent sequences: A110385 A110386 A110387 * 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`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.