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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079344 F(n) mod 8, where F(n)=A000045(n) is the n-th Fibonacci number. 9
0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5, 2, 7, 1, 0, 1, 1, 2, 3, 5, 0, 5, 5 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

REFERENCES

P. Ribenboim, FFF (Favorite Fibonacci Flowers), Fib. Q. 43 (No. 1, 2005), 3-14.

LINKS

Eric Weisstein's World of Mathematics, Fibonacci Number

FORMULA

Sequence is periodic with Pisano period 12 = (0,1,1,2,3,5,0,5,5,2,7,1).

a(n) = (1/396)*{-17*(n mod 12)+49*[(n+1) mod 12]+214*[(n+2) mod 12]-149*[(n+3) mod 12]+115*[(n+4) mod 12]+16*[(n+5) mod 12]-149*[(n+6) mod 12]+181*[(n+7) mod 12]-50*[(n+8) mod 12]-17*[(n+9) mod 12]-17*[(n+10) mod 12]+16*[(n+11) mod 12]} with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Nov 24 2006

a(n) = (1/396)*{49*[n mod 12] + 214*[(n + 1) mod 12] - 149*[(n + 2) mod 12] + 115*[(n + 3) mod 12] + 16*[(n + 4) mod 12] - 149*[(n + 5) mod 12] + 181*[(n + 6) mod 12] - 50*[(n + 7) mod 12] - 17*[(n + 8) mod 12] - 17*[(n + 9) mod 12] + 16*[(n + 10) mod 12] - 17*[(n + 11) mod 12]}, with n>= 0. - Paolo P. Lava (paoloplava(AT)gmail.com), May 30 2007

EXAMPLE

a(8) = F(8) mod 8 = 21 mod 8 = 5.

MATHEMATICA

a={}; Do[f=Fibonacci[n]; AppendTo[a, Mod[f, 8]], {n, 1, 30}]; a (Vladimir Orlovsky, Jul 23 2008)

PROG

(PARI) for (n=0, 100, print1(fibonacci(n)%8", "))

CROSSREFS

Cf. A000045, A011655, A082115, A079343, A082116, A082117, A079344, A079345, A111958.

Sequence in context: A068909 A039705 A082118 * A096535 A126047 A023049

Adjacent sequences:  A079341 A079342 A079343 * A079345 A079346 A079347

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jan 04 2003

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Dec 06 2008 at the suggestion of R. J. Mathar

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 15 08:40 EST 2012. Contains 205731 sequences.