A089911 a(n) = Fibonacci(n) mod 12.
0, 1, 1, 2, 3, 5, 8, 1, 9, 10, 7, 5, 0, 5, 5, 10, 3, 1, 4, 5, 9, 2, 11, 1, 0, 1, 1, 2, 3, 5, 8, 1, 9, 10, 7, 5, 0, 5, 5, 10, 3, 1, 4, 5, 9, 2, 11, 1, 0, 1, 1, 2, 3, 5, 8, 1, 9, 10, 7, 5, 0, 5, 5, 10, 3, 1, 4, 5, 9, 2, 11, 1, 0, 1, 1, 2, 3, 5, 8, 1, 9, 10, 7, 5, 0, 5, 5, 10, 3, 1, 4, 5, 9, 2, 11, 1, 0, 1, 1
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..1199
- Ron Knott, Fibonacci Numbers and the Golden Section
- M. Renault, The Fibonacci Sequence Modulo M
- A. P. Shah, Fibonacci Sequence Modulo m, Fibonacci Quarterly, Vol.6, No.2 (1968), 139-141.
- D. D. Wall, Fibonacci series modulo m, Amer. Math. Monthly, 67 (1960), 525-532.
- Index entries for linear recurrences with constant coefficients, signature (1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1).
Programs
-
Haskell
a089911 n = a089911_list !! n a089911_list = 0 : 1 : zipWith (\u v -> (u + v) `mod` 12) (tail a089911_list) a089911_list -- Reinhard Zumkeller, Jul 01 2013
-
Magma
[Fibonacci(n) mod 12: n in [0..100]]; // Vincenzo Librandi, Feb 04 2014
-
Maple
with(combinat,fibonacci); A089911 := proc(n) fibonacci(n) mod 12; end;
-
Mathematica
Table[Mod[Fibonacci[n], 12], {n, 0, 100}] (* Vincenzo Librandi, Feb 04 2014 *)
-
PARI
a(n)=fibonacci(n)%12 \\ Charles R Greathouse IV, Feb 03 2014
Formula
Has period of 24, restricted period 12 and multiplier 5.
a(n) = (a(n-1) + a(n-2)) mod 12, a(0) = 0, a(1) = 1.
Extensions
More terms from Ray Chandler, Nov 15 2003
Comments