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 A070364 #20 Dec 18 2023 14:19:28
%S A070364 1,3,9,27,34,8,24,25,28,37,17,4,12,36,14,42,32,2,6,18,7,21,16,1,3,9,
%T A070364 27,34,8,24,25,28,37,17,4,12,36,14,42,32,2,6,18,7,21,16,1,3,9,27,34,8,
%U A070364 24,25,28,37,17,4,12,36,14,42,32,2,6,18,7,21,16,1,3,9,27,34,8,24,25,28,37
%N A070364 a(n) = 3^n mod 47.
%H A070364 G. C. Greubel, <a href="/A070364/b070364.txt">Table of n, a(n) for n = 0..1000</a>
%H A070364 <a href="/index/Rec#order_23">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070364 a(n) = a(n-23). - _R. J. Mathar_, Apr 20 2010
%t A070364 PowerMod[3, Range[0,50], 47] (* or *) Table[Mod[3^n, 47], {n, 0, 100}] (* _G. C. Greubel_, Mar 09 2016 *)
%o A070364 (PARI) a(n)=lift(Mod(3,47)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%K A070364 nonn,easy
%O A070364 0,2
%A A070364 _N. J. A. Sloane_, May 12 2002