|
| |
|
|
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.
|
|
1
| |
|
|
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; refs; listen; history; 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.
|
|
|
CROSSREFS
| Sequence in context: A091663 A011316 A151753 * A205135 A076567 A146535
Adjacent sequences: A144540 A144541 A144542 * A144544 A144545 A144546
|
|
|
KEYWORD
| nonn,base,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Dec 20 2008
|
| |
|
|
