This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079345 #14 Sep 08 2022 08:45:08
%S A079345 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,
%T A079345 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,
%U A079345 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
%N A079345 Fibonacci(n) mod 16.
%C A079345 Periodic with period 24. - _Jon Perry_, Jan 08 2003
%H A079345 Vincenzo Librandi, <a href="/A079345/b079345.txt">Table of n, a(n) for n = 0..1000</a>
%H A079345 <a href="/index/Rec#order_24">Index entries for linear recurrences with constant coefficients</a>, 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).
%e A079345 a(8) = F(8) mod 16 = 21 mod 16 = 5.
%t A079345 a={};Do[f=Fibonacci[n];AppendTo[a,Mod[f,16]],{n,1,30}];a (* _Vladimir Joseph Stephan Orlovsky_, Jul 23 2008 *)
%t A079345 Table[Mod[Fibonacci[n], 16], {n, 0, 100}] (* _Vincenzo Librandi_, Feb 04 2014 *)
%o A079345 (PARI) for (n=1,100,print1(fibonacci(n)%16","))
%o A079345 (Magma) [Fibonacci(n) mod 16: n in [0..100]]; // _Vincenzo Librandi_, Feb 04 2014
%Y A079345 Cf. A079343, A079344.
%K A079345 nonn,easy
%O A079345 0,4
%A A079345 _Jon Perry_, Jan 04 2003