|
| |
|
|
A133615
|
|
Unique sequence of digits a(0), a(1), a(2), .. such that for all k >= 2, the number A(k) := Sum_{n = 0..k-1 } a(n)*10^n satisfies 5^A(k) == A(k) mod 10^k.
|
|
0
| |
|
|
5, 2, 1, 3, 0, 2, 8, 0, 4, 8, 1, 6, 2, 5, 1, 3, 9, 4, 7, 1, 1, 7, 8, 5, 3, 8, 0, 9, 5, 1, 1, 5, 6, 9, 8, 0, 4, 9, 2, 2, 9, 8, 9, 3, 3, 9, 8, 1, 3, 3, 1, 7, 7, 4, 6, 7, 1, 0, 2, 8, 3, 7, 5, 1, 7, 3, 1, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| 10-adic expansion of the iterated exponential 5^^n for sufficiently large n (where c^^n denotes a tower of c's of height n). E.g. For n>9, 5^^n == 8203125 (mod 10^7)
|
|
|
REFERENCES
| M. Ripà, La strana coda della serie n^n^...^n, Trento, UNI Service, Nov 2011, p. 69-78. ISBN 978-88-6178-789-6.
J. Jimenez Urroz and J. Luis A. Yebra, On the equation a^x == x (mod b^n), Preprint, Oct 28 2008.
|
|
|
CROSSREFS
| Sequence in context: A089086 A038631 A158625 * A136161 A197383 A091505
Adjacent sequences: A133612 A133613 A133614 * A133616 A133617 A133618
|
|
|
KEYWORD
| nonn,base,changed
|
|
|
AUTHOR
| Daniel Geisler (daniel(AT)danielgeisler.com), Dec 18 2007
|
|
|
EXTENSIONS
| More terms from J. Luis A. Yebra, Dec 12 2008
Edited by N. J. A. Sloane (njas(AT)research.att.com), Dec 22 2008
|
| |
|
|
