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 A066431 #14 Dec 19 2024 13:21:02
%S A066431 0,81,729,6561,59049,531441,4782969,43046721,0,486784401,727739626,
%T A066431 3801397473,7390478182,5013665073,26942641524,68218142337,50040016962,
%U A066431 127461340881,20157955560,179056928801,95734214766,798384194161,812529625653,123794634177,1880664942124
%N A066431 a(n) = 9^n mod n^9.
%H A066431 Harry J. Smith, <a href="/A066431/b066431.txt">Table of n, a(n) for n = 1..500</a>
%t A066431 Table[ Mod[ 9^n, n^9], {n, 1, 30} ]
%t A066431 Table[PowerMod[9,n,n^9],{n,30}] (* _Harvey P. Dale_, May 30 2022 *)
%o A066431 (PARI) a(n) = { lift(Mod(9, n^9)^n) } \\ _Harry J. Smith_, Feb 13 2010
%Y A066431 Cf. A066606.
%K A066431 nonn
%O A066431 1,2
%A A066431 _Robert G. Wilson v_, Dec 27 2001