|
%I #17 Jul 11 2020 05:23:38
%S 89,187,968,1837,9218,17347,91718,173437,907808,1716517,8872688,
%T 17735476,85189247,159487405,664272356,1317544822,3602001953,
%U 7193004016,13297007933,47267087164,93445163438
%N Trajectory of 89 under map x->x + (x-with-digits-reversed).
%C The sequence reaches a palindrome at a(24)= 8813200023188 (cf. A033665). - _Klaus Brockhaus_, Jun 07 2002
%D Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975), page PC30-6. Gives full 25-term trajectory of 89.
%H Vincenzo Librandi, <a href="/A033670/b033670.txt">Table of n, a(n) for n = 0..1000</a>
%H Jason Doucette, <a href="http://www.jasondoucette.com/worldrecords.html#Most">World Records</a>
%H I. Peter, <a href="http://www.floot.demon.co.uk/palindromes.html">More trajectories</a>
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e a(3) = 968 because 187 + 781 = 968
%t NestList[# + FromDigits[Reverse[IntegerDigits[#]]]&, 89, 40] (* _Vincenzo Librandi_, May 03 2014 *)
%K nonn,base
%O 0,1
%A _N. J. A. Sloane_.
|
