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 A112296 #20 Sep 09 2021 09:35:05
%S A112296 9,9,81,99,891,9801,9801,19602,39204,79497,499851,548856,1077021,
%T A112296 2274822,4459554,8909109,70282971,87111288,664223571,730645938,
%U A112296 5791910751,6272012637,36351143631,49985258994,88971507999,789520249881,868572264879,7470454307481
%N A112296 Smret suoiverp eht fo mus fo esrever.
%D A112296 Zak Seidov, Posting to Seq Fan mailing list, Nov 28 2005.
%H A112296 Michael De Vlieger, <a href="/A112296/b112296.txt">Table of n, a(n) for n = 1..2419</a>
%p A112296 a[0]:=9: S:=a[0]: for n from 1 to 30 do S1:=convert(S,base,10): c:=nops(S1): a[n]:=add(S1[c+1-j]*10^(j-1),j=1..c): S:=S+a[n]: od: seq(a[n],n=0..30); # _Emeric Deutsch_, Feb 03 2006
%t A112296 Nest[Append[#, IntegerReverse@ Total@ #] &, {9}, 27] (* _Michael De Vlieger_, Sep 09 2021 *)
%o A112296 (Python)
%o A112296 def aupton(terms):
%o A112296 alst, s = [9], 9
%o A112296 for n in range(2, terms+1):
%o A112296 alst.append(int(str(s)[::-1]))
%o A112296 s += alst[-1]
%o A112296 return alst
%o A112296 print(aupton(28)) # _Michael S. Branicky_, Sep 09 2021
%Y A112296 Cf. A004086.
%K A112296 nonn,base
%O A112296 1,1
%A A112296 _N. J. A. Sloane_, Nov 30 2005
%E A112296 More terms from _Emeric Deutsch_, Feb 03 2006