login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007887 Fibonacci(n) mod 9. 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; refs; listen; history; internal format)
OFFSET

0,4

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).

FORMULA

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

Sequence in context: A152303 A064737 A098906 * A105472 A030132 A004090

Adjacent sequences:  A007884 A007885 A007886 * A007888 A007889 A007890

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.