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 A262208 #19 Sep 08 2022 08:46:14
%S A262208 0,3,20,247,1861,28669,202564,12127115,115222124,6126483469,
%T A262208 19465244918,4282552771669,4226847828547,3334905643119667,
%U A262208 311202902635062863,13506468355090939237,455126377640041434982,3558300899222541879853
%N A262208 a(n) = prime(n)^prime(n) mod n^n.
%C A262208 Inspired by A262207.
%F A262208 a(n) = A051674(n) mod A000312(n).
%e A262208 For n = 2, a(n) = 27 mod 4 = 3.
%t A262208 Table[Mod[Prime[n]^Prime[n], n^n], {n, 18}] (* _Michael De Vlieger_, Sep 15 2015 *)
%o A262208 (PARI) a(n) = (prime(n)^prime(n)) % (n^n);
%o A262208 vector(20, n, a(n))
%o A262208 (Magma) [NthPrime(n)^NthPrime(n) mod n^n: n in [1..20]]; // _Vincenzo Librandi_, Sep 16 2015
%Y A262208 Cf. A262207, A051674, A000312, A004648.
%K A262208 nonn,easy
%O A262208 1,2
%A A262208 _Altug Alkan_, Sep 15 2015