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 A070341 #37 Dec 14 2023 05:25:32
%S A070341 1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,
%T A070341 4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,
%U A070341 5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9,5,4,1,3,9
%N A070341 a(n) = 3^n mod 11: Repeat (1, 3, 9, 5, 4), period 5.
%C A070341 Simple continued fraction expansion of 13/24 + sqrt(8761)/120 = 1.3216684472... - _R. J. Mathar_, Mar 08 2012
%H A070341 G. C. Greubel, <a href="/A070341/b070341.txt">Table of n, a(n) for n = 0..1000</a>
%H A070341 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 1).
%F A070341 From _R. J. Mathar_, Apr 13 2010: (Start)
%F A070341 a(n) = a(n-5).
%F A070341 G.f.: (1+3*x+9*x^2+5*x^3+4*x^4)/ ((1-x) * (1+x+x^2+x^3+x^4)). (End)
%t A070341 PowerMod[3,Range[0,100],11] (* or *) PadRight[{},100,{1,3,9,5,4}] (* _Harvey P. Dale_, Feb 05 2012 *)
%o A070341 (Sage) [power_mod(3, n, 11)for n in range(0, 93)] # _Zerinvary Lajos_, Nov 24 2009
%o A070341 (PARI) a(n)=lift(Mod(3,11)^n)
%o A070341 (PARI) a(n)=[1, 3, 9, 5, 4][n%5+1] \\ _M. F. Hasler_, Mar 04 2011
%K A070341 nonn,easy
%O A070341 0,2
%A A070341 _N. J. A. Sloane_, May 12 2002