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 A070356 #30 Dec 25 2023 11:23:46
%S A070356 1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,
%T A070356 2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,
%U A070356 12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8,1,3,9,4,12,13,16,2,6,18,8
%N A070356 a(n) = 3^n mod 23.
%H A070356 G. C. Greubel, <a href="/A070356/b070356.txt">Table of n, a(n) for n = 0..1000</a>
%H A070356 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,1).
%F A070356 a(n) = a(n-11). - _Vincenzo Librandi_, Feb 06 2011
%t A070356 PowerMod[3, Range[0,50], 23] (* or *) Table[Mod[3^n, 23], {n, 0, 100}] (* _G. C. Greubel_, Mar 09 2016 *)
%o A070356 (Sage) [power_mod(3,n,23)for n in range(0, 88)] # _Zerinvary Lajos_, Nov 25 2009
%o A070356 (PARI) a(n)=lift(Mod(3,23)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%Y A070356 Cf. A000244.
%K A070356 nonn,easy
%O A070356 0,2
%A A070356 _N. J. A. Sloane_, May 12 2002