|
| |
|
|
A144541
|
|
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 13^A(k) == A(k) mod 10^k.
|
|
0
|
|
|
|
3, 5, 0, 5, 4, 0, 5, 5, 2, 8, 8, 4, 5, 9, 1, 8, 1, 2, 2, 4, 8, 8, 8, 7, 6, 9, 2, 0, 7, 1, 6, 8, 6, 9, 0, 4, 6, 7, 3, 2, 3, 5, 6, 8, 9, 4, 4, 3, 6, 6, 5, 6, 6, 3, 5, 9, 3, 1, 7, 0, 4, 3, 3, 7, 4, 6, 1, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
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.
|
|
|
LINKS
|
Table of n, a(n) for n=0..67.
|
|
|
CROSSREFS
|
Sequence in context: A102575 A200520 A224933 * A100609 A104866 A165723
Adjacent sequences: A144538 A144539 A144540 * A144542 A144543 A144544
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
N. J. A. Sloane, Dec 20 2008
|
|
|
STATUS
|
approved
|
| |
|
|
