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 A066611 #19 Dec 07 2024 14:55:26
%S A066611 1,0,3,13,53,2906,30391,306356,1544521,314487775,5311670611,
%T A066611 71438659315,8643791799805,208502988236908,4525624184096751,
%U A066611 55200677713457866,15583522643116493073,466115766638709659105,11099251895486710352779,1358250003379776429113,75419018385982521381124421
%N A066611 a(1) = 1; a(n) = n^n mod (n-1)^(n-1) for n > 1.
%H A066611 Harry J. Smith, <a href="/A066611/b066611.txt">Table of n, a(n) for n = 1..100</a>
%e A066611 a(5) = 53 as 5^5 = 3125 = (4^4)*12 + 53.
%t A066611 Table[ Mod[ n^n, (n - 1)^(n - 1)], {n, 2, 20} ]
%t A066611 Join[{1},Table[PowerMod[n,n,(n-1)^(n-1)],{n,2,20}]] (* _Harvey P. Dale_, Dec 14 2017 *)
%o A066611 (PARI) a(n) = { n^n % (n-1)^(n-1) } \\ _Harry J. Smith_, Mar 12 2010
%K A066611 easy,nonn
%O A066611 1,3
%A A066611 _Amarnath Murthy_, Dec 24 2001
%E A066611 More terms from _Robert G. Wilson v_, Dec 26 2001