|
Search: id:A094190
|
|
|
| A094190 |
|
Least n-digit automorphic number. |
|
+0
1
|
|
| 0, 25, 376, 9376, 90625, 109376, 2890625, 12890625, 212890625, 1787109376, 18212890625, 918212890625, 9918212890625, 40081787109376, 259918212890625, 3740081787109376, 43740081787109376, 256259918212890625, 2256259918212890625
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)= Min( 5^(2^n) (mod 10^n), 16^(5^n) (mod 10^n) ). - terms from 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] - terms from Robert G. Wilson v Aug 27 2006
|
|
CROSSREFS
|
Cf. A003226.
Cf. A003226, A007185, A016090.
Sequence in context: A059255 A022749 A036071 this_sequence A069396 A125482 A028130
Adjacent sequences: A094187 A094188 A094189 this_sequence A094191 A094192 A094193
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), May 25 2004
|
|
EXTENSIONS
|
Corrected and extended by terms from Robert G. Wilson v Aug 27 2006
|
|
|
Search completed in 0.002 seconds
|
