A079345 Fibonacci(n) mod 16.
0, 1, 1, 2, 3, 5, 8, 13, 5, 2, 7, 9, 0, 9, 9, 2, 11, 13, 8, 5, 13, 2, 15, 1, 0, 1, 1, 2, 3, 5, 8, 13, 5, 2, 7, 9, 0, 9, 9, 2, 11, 13, 8, 5, 13, 2, 15, 1, 0, 1, 1, 2, 3, 5, 8, 13, 5, 2, 7, 9, 0, 9, 9, 2, 11, 13, 8, 5, 13, 2, 15, 1, 0, 1, 1, 2, 3, 5, 8, 13, 5, 2, 7, 9, 0, 9, 9, 2, 11, 13, 8, 5, 13, 2
Offset: 0
Examples
a(8) = F(8) mod 16 = 21 mod 16 = 5.
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..1000
- Index entries for 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).
Programs
-
Magma
[Fibonacci(n) mod 16: n in [0..100]]; // Vincenzo Librandi, Feb 04 2014
-
Mathematica
a={};Do[f=Fibonacci[n];AppendTo[a,Mod[f,16]],{n,1,30}];a (* Vladimir Joseph Stephan Orlovsky, Jul 23 2008 *) Table[Mod[Fibonacci[n], 16], {n, 0, 100}] (* Vincenzo Librandi, Feb 04 2014 *)
-
PARI
for (n=1,100,print1(fibonacci(n)%16","))
Comments