This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A066054 #20 Jun 15 2018 22:10:00
%S A066054 10583,49084,97178,184357,937838,1776577,9533348,17966707,88733678,
%T A066054 176367466,841131137,1572262285,7394885036,13700769973,51697470704,
%U A066054 92404950319,183710890748,1030808908129,10248906988430,13737867972631
%N A066054 'Reverse and Add!' trajectory of 10583.
%H A066054 Harry J. Smith and Vincenzo Librandi, <a href="/A066054/b066054.txt">Table of n, a(n) for n = 0..1000</a> (the first 150 terms from Harry J. Smith)
%H A066054 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e A066054 a(1) = 10583 + 38501 = 49084.
%t A066054 NestList[# + FromDigits[Reverse[IntegerDigits[#]]]&, 10583, 40] (* _Vincenzo Librandi_, May 03 2014 *)
%o A066054 (ARIBAS): m := 10583; stop := 20; c := 0; rev := int_reverse(m); while m <> rev and c < stop do inc(c); write(m," "); m := m + rev; rev := int_reverse(m); end;
%o A066054 (PARI) Rev(x)= { local(d, r=0); while (x>0, d=x%10; x\=10; r=r*10 + d); return(r) } { a=10583; for (n = 0, 150, if (n, a+=Rev(a)); write("b066054.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 08 2009
%o A066054 (Haskell)
%o A066054 a066054 n = a066054_list !! n
%o A066054 a066054_list = iterate a056964 10583 -- _Reinhard Zumkeller_, Sep 22 2011
%Y A066054 Cf. A033865, A023108, A006960, A066055.
%Y A066054 Cf. A056964, A004086.
%K A066054 base,nonn
%O A066054 0,1
%A A066054 _Klaus Brockhaus_, Nov 30 2001