|
%I #19 Mar 06 2014 18:22:39
%S 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,
%T 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,
%U 2,2,1,9,8,5,2,4,5,2,4,5,3,6,5,5,8,6,7,2,7,5,4,7,7,4,6,9,1,8,3,8,3,7,1,5,0
%N 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.
%D M. Ripà, La strana coda della serie n^n^...^n, Trento, UNI Service, Nov 2011, p. 69-78. ISBN 978-88-6178-789-6.
%D Ilan Vardi, "Computational Recreations in Mathematica," Addison-Wesley Publishing Co., Redwood City, CA, 1991, pages 226-229.
%H Robert G. Wilson v, <a href="/A144543/b144543.txt">Table of n, a(n) for n = 0..1024</a>
%H J. Jimenez Urroz and J. Luis A. Yebra, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL12/Yebra/yebra4.html">On the equation a^x == x (mod b^n), J. Int. Seq. 12 (2009) #09.8.8
%e 573958083567096086449346119283793862477858654472393049431441904930012219852452...
%t (* Import Mmca coding for "SuperPowerMod" and "LogStar" from text file in A133612 and then *) $RecursionLimit = 2^14; f[n_] := SuperPowerMod[15, n + 1, 10^n]; Reverse@ IntegerDigits@ f@ 105 (* _Robert G. Wilson v_, Mar 06 2014 *)
%Y Cf. A133612, A133613, A133614, A133615, A133616, A133617, A133618, A133619, A144539, A144540, A144541, A144542, A144544.
%K nonn,base
%O 0,1
%A _N. J. A. Sloane_, Dec 20 2008
%E a(68) onward from _Robert G. Wilson v_, Mar 06 2014
|
