|
Search: id:A133618
|
|
|
| A133618 |
|
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 8^A(k) == A(k) mod 10^k. |
|
+0
1
|
|
| 6, 5, 8, 5, 2, 2, 5, 9, 8, 6, 1, 4, 5, 3, 0, 7, 7, 5, 1, 2, 5, 1, 8, 0, 0, 1, 5, 8, 8, 5, 5, 9, 0, 2, 6, 1, 3, 9, 1, 1, 5, 6, 2, 9, 8, 3, 7, 7, 2, 0, 1, 5, 7, 3, 8, 8, 2, 6, 6, 7, 0, 3, 7, 5, 7, 2, 7, 4
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
10-adic expansion of the iterated exponential 8^^n for sufficiently large n (where c^^n denotes a tower of c's of height n). E.g. For n>9, 8^^n == 5225856 (mod 10^7)
|
|
REFERENCES
|
J. Jimenez Urroz and J. Luis A. Yebra, On the equation a^x == x (mod b^n), Preprint, Oct 28 2008.
|
|
EXAMPLE
|
8^56 == 56 (mod 100), 8^856 == 856 (mod 1000), ...
|
|
KEYWORD
|
nonn,base,new
|
|
AUTHOR
|
Daniel Geisler (daniel(AT)danielgeisler.com), Dec 18 2007
|
|
EXTENSIONS
|
More terms from J. Luis A. Yebra, Dec 12 2008
Edited by njas, Dec 22 2008
|
|
|
Search completed in 0.002 seconds
|
