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 A117131 #21 Sep 08 2022 08:45:24
%S A117131 1,1,2,4,1,12,12,7,2,6,24,26,11,6,30,15,9,41,39,32,51,64,78,4,72,43,
%T A117131 89,25,31,109,26,62,80,36,9,72,132,140,105,52,132,135,117,147,79,193,
%U A117131 93,49,175,76,64,187,196,9,163,221,190,62,102,280,71,87,102,268
%N A117131 Remainder when n^n is divided by the n-th prime number.
%H A117131 T. D. Noe, <a href="/A117131/b117131.txt">Table of n, a(n) for n = 1..10000</a>
%F A117131 a(n) = mod(n^n, prime(n)).
%e A117131 a(8)=7 because 8^8 is 16777216, the 8th prime is 19 and 16777216 modulo 19 is 7.
%p A117131 a:= n-> n&^n mod ithprime(n):
%p A117131 seq(a(n), n=1..81); # _Alois P. Heinz_, Mar 20 2019
%t A117131 Table[PowerMod[n, n, Prime[n]], {n, 100}] (* _T. D. Noe_, Aug 20 2013 *)
%o A117131 (Magma) [Modexp(n, n, NthPrime(n)): n in [1..100]]; // _Vincenzo Librandi_, Mar 20 2019
%o A117131 (PARI) a(n) = lift(Mod(n, prime(n))^n); \\ _Michel Marcus_, Mar 20 2019
%Y A117131 Cf. A000312, A069547.
%K A117131 nonn,look,easy
%O A117131 1,3
%A A117131 _Axel Harvey_, Jul 23 2006
%E A117131 More terms from _Franklin T. Adams-Watters_, Jul 26 2006