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 A094190 #12 Mar 21 2015 10:33:33
%S A094190 0,25,376,9376,90625,109376,2890625,12890625,212890625,1787109376,
%T A094190 18212890625,918212890625,9918212890625,40081787109376,
%U A094190 259918212890625,3740081787109376,43740081787109376,256259918212890625,2256259918212890625
%N A094190 Least n-digit automorphic number.
%F A094190 a(n) = Min( 5^(2^n) (mod 10^n), 16^(5^n) (mod 10^n) ). - _Robert G. Wilson v_, Aug 27 2006
%t A094190 f[n_] := If[n == 1, 0, Block[{a5 = PowerMod[5, 2^n, 10^n], a6 = PowerMod[16, 5^n, 10^n]}, If[a5 < 10^(n - 1), a5 = 10^(n + 1)]; If[a6 < 10^(n - 1), a6 = 10^(n + 1)]; Min[a5, a6]]]; Array[f, 19] (* _Robert G. Wilson v_, Aug 27 2006 *)
%Y A094190 Cf. A003226, A003226, A007185, A016090.
%K A094190 nonn,base
%O A094190 1,2
%A A094190 _Lekraj Beedassy_, May 25 2004
%E A094190 Corrected and extended by _Robert G. Wilson v_, Aug 27 2006