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 A347671 #32 Aug 13 2023 13:23:48
%S A347671 1,1,4,27,56,25,56,43,16,89,0,11,56,53,16,75,16,77,24,79,0,21,84,67,
%T A347671 76,25,76,3,36,69,0,31,76,13,36,75,36,17,4,59,0,41,64,7,96,25,96,63,
%U A347671 56,49,0,51,96,73,56,75,56,57,84,39,0,61,44,47,16,25,16,23
%N A347671 a(n) = n^n mod 100.
%H A347671 <a href="/index/Rec#order_100">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A347671 For n >= 101, a(n) = a(n-100), i.e., cyclic with period A174824(100) = 100, disregarding a(0). - _Michael S. Branicky_, Sep 26 2021
%t A347671 Table[PowerMod[n,n,100],{n,0,70}] (* _Harvey P. Dale_, Aug 13 2023 *)
%o A347671 (Python)
%o A347671 def a(n): return pow(n, n, 100)
%o A347671 print([a(n) for n in range(101)]) # _Michael S. Branicky_, Sep 26 2021
%Y A347671 Cf. A000312 (n^n), A056849 (mod 10), A174824.
%K A347671 nonn,base,easy
%O A347671 0,3
%A A347671 _John Bibby_, Sep 10 2021