|
Search: id:A079344
|
|
|
| A079344 |
|
F(n) mod 8, where F(n)=A000045(n) is the n-th Fibonacci number. |
|
+0
8
|
|
| 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; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Periodic with period of length 12 = (0,1,1,2,3,5,0,5,5,2,7,1). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 05 2003
|
|
REFERENCES
|
P. Ribenboim, FFF (Favorite Fibonacci Flowers), Fib. Q. 43 (No. 1, 2005), 3-14.
|
|
FORMULA
|
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 (ppl(AT)spl.at), May 30 2007
|
|
EXAMPLE
|
a(8) = F(8) mod 8 = 21 mod 8 = 5.
|
|
PROGRAM
|
(PARI) for (n=0, 100, print1(fibonacci(n)%8", "))
|
|
CROSSREFS
|
Cf. A000045, A079343, A079345, A111958.
Adjacent sequences: A079341 A079342 A079343 this_sequence A079345 A079346 A079347
Sequence in context: A068909 A039705 A082118 this_sequence A096535 A126047 A023049
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Jan 04 2003
|
|
|
Search completed in 0.002 seconds
|
