id:A007887 - OEIS Search Results

Search: id:A007887

Displaying 1-1 of 1 results found.

page 1

Fibonacci(n) mod 9.

+0
3

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

	OFFSET	`0,4`
	FORMULA	`a(n) has period 24. Proof: F_{n+24} = F_n + 9(5152 F_{n+1} + 3184 F_n). - Olivier Wittenberg, following a conjecture by Ralf Stephan, Sep 28 2004` `The numbers have period 24 since F_{n+24} = F_n + 9(5152 F_{n+1} + 3184 F_n). - Olivier Wittenberg, Sep 28 2004`
	CROSSREFS	`Adjacent sequences: A007884 A007885 A007886 this_sequence A007888 A007889 A007890` `Sequence in context: A003893 A064737 A098906 this_sequence A105472 A030132 A130833`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research