|
Search: id:A144543
|
|
|
| A144543 |
|
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 15^A(k) == A(k) mod 10^k. |
|
+0
2
|
|
| 5, 7, 3, 9, 5, 8, 0, 8, 3, 5, 6, 7, 0, 9, 6, 0, 8, 6, 4, 4, 9, 3, 4, 6, 1, 1, 9, 2, 8, 3, 7, 9, 3, 8, 6, 2, 4, 7, 7, 8, 5, 8, 6, 5, 4, 4, 7, 2, 3, 9, 3, 0, 4, 9, 4, 3, 1, 4, 4, 1, 9, 0, 4, 9, 3, 0, 0, 1
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
