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 A111958 #21 Jan 05 2025 19:51:38
%S A111958 2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,7,4,
%T A111958 3,7,2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,
%U A111958 7,4,3,7,2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,7,4,3,7,2,1,3,4,7,3,2,5,7
%N A111958 Lucas numbers (A000032) mod 8.
%C A111958 This sequence has period-length 12.
%H A111958 G. C. Greubel, <a href="/A111958/b111958.txt">Table of n, a(n) for n = 0..9999</a>
%H A111958 Paulo Ribenboim, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/43-1/paper43-1-1.pdf">FFF (Favorite Fibonacci Flowers)</a>, Fib. Quart. 43 (No. 1, 2005), 3-14.
%H A111958 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1,-1,1,-1,1,-1,1).
%F A111958 From _G. C. Greubel_, Feb 08 2016: (Start)
%F A111958 a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) - a(n-6) + a(n-7) - a(n-8) + a(n-9) - a(n-10) + a(n-11).
%F A111958 a(n+12) = a(n). (End)
%t A111958 LinearRecurrence[{1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1}, {2, 1, 3, 4, 7, 3, 2, 5, 7, 4, 3}, 105] (* _Ray Chandler_, Aug 27 2015 *)
%t A111958 Mod[LucasL[Range[0, 99]], 8] (* _Alonso del Arte_, Dec 19 2015 *)
%Y A111958 Cf. A000032, A079344, A130893.
%K A111958 nonn
%O A111958 0,1
%A A111958 _N. J. A. Sloane_, Nov 28 2005