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 A079343 #48 Dec 14 2023 05:07:07
%S A079343 0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,
%T A079343 3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,
%U A079343 1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1,2,3,1,0,1,1
%N A079343 Period 6: repeat [0, 1, 1, 2, 3, 1]; also F(n) mod 4, where F(n) = A000045(n).
%C A079343 This sequence shows that every sixth Fibonacci number (A134492) is divisible by 4. - _Alonso del Arte_, Jul 27 2013
%H A079343 Vincenzo Librandi, <a href="/A079343/b079343.txt">Table of n, a(n) for n = 0..1000</a>
%H A079343 Jon Maiga, <a href="http://jonkagstrom.com/articles/upper_bound_of_fibonacci_entry_points.pdf">Upper bound of Fibonacci entry points</a>, (2019).
%H A079343 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1).
%F A079343 a(n) = 2^(1 - P(3, n) + P(6, n+2))*3^P(6, n+3) - 1, where P(k, n) = floor(1/2*cos(2*n*Pi/k) + 1/2). [_Gary Detlefs_, May 16 2011]
%F A079343 a(n) = 4/3 - cos(Pi*n/3) - sin(Pi*n/3)/sqrt(3) - cos(2*Pi*n/3)/3 + sin(2*Pi*n/3)/sqrt(3). - _R. J. Mathar_, Oct 08 2011
%F A079343 G.f.: x*(1+2*x^2+x^3) / ( (1-x)*(1-x+x^2)*(1+x+x^2) ). - _R. J. Mathar_, Jul 14 2012
%F A079343 a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4. - _Wesley Ivan Hurt_, Jun 20 2016
%F A079343 E.g.f.: 2*(2*exp(x) - sqrt(3)*sin(sqrt(3)*x/2)*sinh(x/2) - cos(sqrt(3)*x/2)*(sinh(x/2) + 2*cosh(x/2)))/3. - _Ilya Gutkovskiy_, Jun 20 2016
%e A079343 a(5) = F(5) mod 4 = 5 mod 4 = 1.
%e A079343 a(6) = F(6) mod 4 = 8 mod 4 = 0.
%e A079343 a(7) = F(7) mod 4 = 13 mod 4 = 1.
%p A079343 A079343:=n->[0, 1, 1, 2, 3, 1][(n mod 6)+1]: seq(A079343(n), n=0..100); # _Wesley Ivan Hurt_, Jun 20 2016
%t A079343 PadLeft[{}, 108, {0, 1, 1, 2, 3, 1}] (* _Harvey P. Dale_, Aug 10 2011 *)
%t A079343 Table[Mod[Fibonacci[n], 4], {n, 0, 127}] (* _Alonso del Arte_, Jul 27 2013 *)
%t A079343 LinearRecurrence[{1, -1, 1, -1, 1},{0, 1, 1, 2, 3},105] (* _Ray Chandler_, Aug 27 2015 *)
%o A079343 (PARI) for (n=0,100,print1(fibonacci(n)%4","))
%o A079343 (Magma) [Fibonacci(n) mod 4: n in [0..100]]; // _Vincenzo Librandi_, Feb 04 2014
%Y A079343 Cf. A000045, A079344, A079345, A134492.
%K A079343 nonn,easy
%O A079343 0,4
%A A079343 _Jon Perry_, Jan 04 2003