login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094190 Least n-digit automorphic number. 0
0, 25, 376, 9376, 90625, 109376, 2890625, 12890625, 212890625, 1787109376, 18212890625, 918212890625, 9918212890625, 40081787109376, 259918212890625, 3740081787109376, 43740081787109376, 256259918212890625, 2256259918212890625 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Min( 5^(2^n) (mod 10^n), 16^(5^n) (mod 10^n) ). - Robert G. Wilson v, Aug 27 2006
MATHEMATICA
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 *)
CROSSREFS
Sequence in context: A022749 A036071 A225968 * A069396 A228216 A261485
KEYWORD
nonn,base
AUTHOR
Lekraj Beedassy, May 25 2004
EXTENSIONS
Corrected and extended by Robert G. Wilson v, Aug 27 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)