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 A066432 #11 Dec 19 2024 13:20:58
%S A066432 0,100,1000,10000,100000,1000000,10000000,100000000,1000000000,0,
%T A066432 22187726197,9322172416,74188586872,207144033280,88222656250,
%U A066432 1041257005056,654556028253,1391503283200,4084075030363,0,2770357806334,15498434643968,29882775483895,5484153143296
%N A066432 a(n) = 10^n mod n^10.
%H A066432 Harry J. Smith, <a href="/A066432/b066432.txt">Table of n, a(n) for n = 1..500</a>
%t A066432 Table[ Mod[ 10^n, n^10], {n, 1, 25} ]
%o A066432 (PARI) a(n) = { lift(Mod(10, n^10)^n) } \\ _Harry J. Smith_, Feb 13 2010
%Y A066432 Cf. A066606.
%K A066432 nonn
%O A066432 1,2
%A A066432 _Robert G. Wilson v_, Dec 27 2001