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 A168429 #35 Jan 05 2025 19:51:39
%S A168429 1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,
%T A168429 3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,
%U A168429 9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3,1,4,5,9,3
%N A168429 a(n) = 4^n mod 11.
%C A168429 Period 5: repeat [1, 4, 5, 9, 3].
%H A168429 Vincenzo Librandi, <a href="/A168429/b168429.txt">Table of n, a(n) for n = 0..1000</a>
%H A168429 Joshua Ide and Marc S. Renault, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/50-2/IdeRenault.pdf">Power Fibonacci Sequences</a>, Fib. Q. 50(2), 2012, 175-179.
%H A168429 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F A168429 a(n) = a(n-5). G.f.: (1+4*x+5*x^2+9*x^3+3*x^4)/((1-x) * (1+x+x^2+x^3+x^4)). - _R. J. Mathar_, Apr 13 2010
%t A168429 Table[Mod[4^n, 11], {n, 0, 50}] (* _G. C. Greubel_, Mar 05 2016 *)
%t A168429 PowerMod[4,Range[0,100],11] (* or *) PadRight[{},100,{1,4,5,9,3}] (* _Harvey P. Dale_, Jul 02 2021 *)
%o A168429 (Sage) [power_mod(4, n, 11) for n in range(0, 95)]
%o A168429 (PARI) a(n)=4^n%11 \\ _Charles R Greathouse IV_, Oct 16 2015
%Y A168429 See also A036117.
%K A168429 nonn,easy
%O A168429 0,2
%A A168429 _Zerinvary Lajos_, Nov 25 2009